Pagini recente » Cod sursa (job #1437024) | Cod sursa (job #1204514) | Cod sursa (job #213591) | Cod sursa (job #329289) | Cod sursa (job #812171)
Cod sursa(job #812171)
#include<fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int v[500001],dq[500001];
int main()
{ int max,pf=0,pi=0;
int n,k,i;
fin>>n>>k;
max=-32000;
dq[0]=0;
int p,u;
p=1;u=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
while(p<=u&&v[i]<=v[dq[u]])u--;
dq[++u]=i;
if(i-dq[p]>=k)p++;
if(i>=k&&v[dq[p]]>max)
{
max=v[dq[p]];
pi=dq[p-1]+1;
pf=i;
}
}
fout<<pi<<" "<<pf<<" "<<max;
return 0;
}