Pagini recente » Cod sursa (job #1003341) | Cod sursa (job #2029882) | Cod sursa (job #1539667) | Cod sursa (job #797918) | Cod sursa (job #2210053)
#include <fstream>
using namespace std;
ifstream cin("secventa.in");
ofstream cout("secventa.out");
int v[500005],n,i,que[2*500005],k,sol,poss,posd;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
int st=500001,dr=500000;
for(i=1;i<=n;i++)
{
if(st<=dr&& i-que[st]==k)
st++;
while(st<=dr&&v[i]<v[que[dr]])
dr--;
que[++dr]=i;
{
if(sol<v[que[st]])
{
poss=que[st];
posd=i;
}
sol=max(sol,v[que[st]]);
}
}
cout<<poss<<" "<<posd<<" "<<sol;
return 0;
}