Pagini recente » Cod sursa (job #943478) | Cod sursa (job #698169) | Cod sursa (job #2724196) | Cod sursa (job #1232444) | Cod sursa (job #1801858)
#include <iostream>
#include <cstdio>
#include <deque>
using namespace std;
int v[500005];
deque < int > Q;
int n,k,max1=-500005,indmax;
void citire()
{
scanf("%d%d",&n,&k);
Q.push_front(1);
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
if(Q.front()==i-k)
Q.pop_front();
while(!Q.empty()&&v[i]<=v[Q.back()])
Q.pop_back();
Q.push_back(i);
if(i>=k)
if(v[Q.front()]>max1)
{
max1=v[Q.front()];
indmax=i;
}
}
printf("%d %d %d",indmax-k+1,indmax,max1);
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
citire();
//cout << "Hello world!" << endl;
return 0;
}