Cod sursa(job #337489)
Utilizator | Data | 3 august 2009 20:02:24 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <stdio.h>
long a[50002],p1,p2,i,j,n,k;
int main(){
FILE *f,*g;
f=fopen("secv2.in","r");
g=fopen("secv2.out","w");
fscanf(f,"%ld%ld",&n,&k);
a[0]=0;
for(i=1;i<=n;i++){
fscanf(f,"%ld",&a[i]);
a[i]+=a[i-1];
}
long max=-2000000000;
for(i=1;i<=n-k+1;i++)
for(j=i+k-1;j<=n;j++)
if(a[j]-a[i]>max){
max=a[j]-a[i];
p1=i+1;
p2=j;
}
fprintf(g,"%ld %ld %ld\n",p1,p2,max);
fclose(f);
fclose(g);
return 0;
}