Cod sursa(job #168706)
| Utilizator | Data | 31 martie 2008 19:03:56 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <stdio.h>
long a[50005],b[50005],i,j,n,k,max=-32000,x,y;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%ld %ld\n",&n,&k);
for(i=1;i<=n;i++)
{scanf("%ld",&a[i]);b[i]=b[i-1]+a[i];}
for(i=1;i<=n-k+1;i++)
for(j=i+k-1;j<=n;j++)
{
if(max<b[j]-b[i-1]){max=b[j]-b[i-1];x=i;y=j;}
}
printf("%ld %ld %ld",x,y,max);
return 0;
}
