Pagini recente » Cod sursa (job #2298918) | Cod sursa (job #1326744) | Cod sursa (job #1523808) | Cod sursa (job #2916746) | Cod sursa (job #245099)
Cod sursa(job #245099)
#include<stdio.h>
int x[50011],v[500011],k,n,i,p,q,m,a,b,max=-50000,st;
int main(){
FILE *f=fopen("secventa.in","r");
fscanf (f,"%d %d",&n,&k);
v[1]=1;
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
fclose(f);
x[1]=1;
p=1;q=1;
for(i=2;i<=n;i++)
{while(x[p]<i-k+1)
p++;
while(v[i]<v[x[q]] && p<=q)
q--;
q++;
x[q]=i;
if(i==k)
{max=v[x[1]];st=1;}
else
if(v[x[p]]>max&&i>k)
{max=v[x[p]];
st=i-k+1 ;
}
}
FILE *g=fopen("secventa.out","w");
fprintf(g,"%d %d %d",st,(st+k-1),max);
fclose(g);
return 0;}