Cod sursa(job #89243)
Utilizator | Pripoae Teodor Anton toni2007 | Data | 6 octombrie 2007 12:31:29 |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<stdio.h>
int main(){
int i,n,v[50000],j,k,a,b,c;
long long s,max;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d %d",&n,&k);
for (i=0;i<n;++i)
scanf("%d",&v[i]);
max=-25001;
for (c=1;c<1+k;++c)
s+=v[c];
for (i=0;i<n-k+1;++i){
for (j=i+k;j<n;++j){
s+=v[j];
if (s>max){
a=i;
b=j;
max=s;
}
}
s=s-v[i]+v[i+k-1];
}
printf("%d %d %lld",a+1,b+1,max);
return 0;
}