Cod sursa(job #434226)
| Utilizator | Data | 5 aprilie 2010 13:45:50 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
#define lung 50000
int a[lung];
int main()
{
int n,k,i,j,su,s,max,x,y;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
su=0;
for (i=0;i<n;i++)
scanf("%d",&a[i]),su+=a[i];
max=su;x=1;y=n;
for (i=0;i<n;i++)
{
s=su;
for (j=n-1;j>=i;j--)
{
if (s>max && j-i+1>=k)
max=s,x=i+1,y=j+1;
s-=a[j];
}
su-=a[i];
}
printf("%d %d %d\n",x,y,max);
fclose(stdout);
return 0;
}
