Pagini recente » Cod sursa (job #1672399) | Cod sursa (job #314233) | Cod sursa (job #71934)
Cod sursa(job #71934)
#include<stdio.h>
#define v 500002
int a[v],w[v],b[v];
long k,n,q,e,max=-50000,inc,sf,li,lf,l;
void rezolvare(long i)
{
q++;
w[q]=a[i];
b[q]=i;
if (b[q]-b[e]+1>k)
++e;
while (w[q]<w[q-1] && q-1>=e)
{
w[q-1]=w[q];
b[q-1]=b[q];
--q;
}
while (a[li-1]>=a[e])
{
li--;
l++;
}
l=b[q]-b[e]+1;//i-b[e]+1;
li=b[e];
lf=b[q];
if (w[e]>max && lf-li+1>=k)
{
max=w[e];
inc=li+1;
sf=lf+1;
}
/* else if (w[e]==max && lf-li+1>=k && li+1<inc)
{
max=w[e];
inc=li+1;
sf=lf+1;
}*/
}
void citire()
{
freopen("secventa.in","r",stdin);
scanf("%ld%ld", &n, &k);
q=-1;
e=0;
for (long i=0; i<n; i++)
{
scanf("%d", &a[i]);
rezolvare(i);
}
fclose(stdin);
}
void scrie()
{
freopen("secventa.out","w",stdout);
printf("%ld %ld %ld\n",inc,sf,max);
fclose(stdout);
}
int main()
{
citire();
//rezolvare();
scrie();
return 0;
}