Cod sursa(job #540939)
Utilizator | todea darius TodeaDarius | Data | 24 februarie 2011 17:33:26 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
int n,k,i,s[5010],j,max,st,dr,s1;
int main()
{
freopen("ratb.in","r",stdin);
freopen("ratb.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%d",&j);
s1=s1+j;
s[i]=s1;
}
max=-1999999999;
for(i=k;i<=n;i++)
{
for(j=0;j<=i-k;j++)
{
if(max<s[i]-s[j])
{
max=s[i]-s[j];
st=j+1;
dr=i;
}
}
}
printf("%d\n%d %d",max,st,dr);
return 0;
}