Pagini recente » Cod sursa (job #1026161) | Cod sursa (job #2758573) | Cod sursa (job #2868440) | Cod sursa (job #1567821) | Cod sursa (job #962888)
Cod sursa(job #962888)
#include <cstdio>
#include <cstring>
#include <deque>
int n,k,a[500005],q[500005],st,dr,d1,d2,mx=-30005;
long long sol=0;
char c[5000005];
FILE *f,*g;
void Parse()
{ char c2;
int i,nr=0,semn=1,pas=0,len;
scanf("%d %d\n",&n,&k);
gets(c); len=strlen(c);
for(i=0;i<=len;i++)
{ if (c[i]>=48 && c[i]<=57) nr=nr*10+(c[i]-'0');
else
{ if (c[i]=='-') semn=-1;
if (c2>='0' && c2<='9')
{pas++; nr*=semn;
a[pas]=nr;
semn=1;
} nr=0;
}
c2=c[i];
}
}
int main()
{ int i;
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
Parse();
for(i=1;i<=n;i++)
{ while(st<=dr && a[i]<a[q[dr]]) dr--;
dr++; q[dr]=i;
while(q[st]<=i-k) st++;
if (i>=k)
{ if (a[q[st]]>mx) {mx=a[q[st]]; d1=i; d2=d1-k+1;} }
}
printf("%d %d %d",d2,d1,mx);
//printf("%d %d\n",n,k);
//for(i=1;i<=n;i++) printf("%d ",a[i]);
return 0;
}