Pagini recente » Cod sursa (job #489959) | Cod sursa (job #140654) | Cod sursa (job #1907035) | Cod sursa (job #958371) | Cod sursa (job #2031900)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int n,k;
int st,dr,ans;
int dq[500005];
int v[500005];
int main()
{
in>>n>>k;
for(int i=1; i<=n; i++)
in>>v[i];
dq[1]=1;
ans=-2e9;
int front=1,back=1;
for(int i=2; i<=n; i++)
{
while(front<=back && i-dq[front]+1>k) front++;
while(front<=back && v[dq[back]]>=v[i]) back--;
dq[++back]=i;
if(i>=k && v[dq[front]]>ans)
{
ans=v[dq[front]];
st=i-k+1;
dr=i;
}
}
out<<st<<' '<<dr<<' '<<ans<<'\n';
return 0;
}