Pagini recente » Borderou de evaluare (job #3126266) | Borderou de evaluare (job #1904225) | Cod sursa (job #2632709) | Cod sursa (job #405151) | Cod sursa (job #337486)
Cod sursa(job #337486)
#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=0;
for(i=1;i<=n-k;i++)
for(j=i+k;j<=n;j++)
if(a[j]-a[i]>max){
max=a[j]-a[i];
p1=i;
p2=j;
}
fprintf(g,"%ld %ld %ld\n",p1,p2,max);
fclose(f);
fclose(g);
return 0;
}