Cod sursa(job #840506)
| Utilizator | Data | 22 decembrie 2012 20:19:01 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<cstdio>
const int maxn=50001;
int s[maxn],k=0,n=0,x=0,i=0,total=-1250000001,p=0,end=0,begin=1;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
s[i]=s[i-1]+x;
}
end=k;x=0;
for(i=k;i<=n;i++)
{
if (s[i]-x>total)
{
total=s[i]-x;
begin=p;
end=i;
}
if (s[i-k+1]<x)
{
x=s[i-k+1];
p=i-k+2;
}
}
printf("%d %d %d\n",begin+1,end+1,total);
return 0;
}