Pagini recente » Cod sursa (job #1237157) | Cod sursa (job #253743) | Cod sursa (job #827) | Cod sursa (job #941231) | Cod sursa (job #2331182)
#include <fstream>
#include <deque>
#define MAX 500005
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
deque <int> v;
deque <int>::iterator p;
int n,k,ck,a[MAX],st,dr,mmax,c;
int main()
{
f>>n>>k;
for(int i=1; i<=n; ++i)
f>>a[i];
ck=k,k=1-k;
for(int i=1; i<=n; ++i)
{
while(!v.empty() && a[i]<=a[v.back()])
v.pop_back();
while(!v.empty() && v.front()<=k)
v.pop_front();
v.push_back(i),k++;
if(i>=ck && a[v.front()]>mmax)
{
mmax=a[v.front()];
st=v.front(),dr=v.back();
}
}
g<<st<<" "<<dr<<" "<<mmax;
return 0;
}