Cod sursa(job #54557)
Utilizator | Alexandru Dumitru Paunoiu DranaXum | Data | 24 aprilie 2007 23:55:54 |
---|---|---|---|
Problema | Secventa 2 | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<stdio.h>
int main()
{
int a[50000],n,k,max,i,j,pi,pf;
long t[50000];
FILE *fin,*fout;
fin=fopen("secv2.in","r");
fout=fopen("secv2.out","w");
fscanf(fin,"%d%d",&n,&k);
max=-25001;
t[0]=0;
for(i=1;i<=n;i++)
{
fscanf(fin,"%d",&a[i]);
t[i]+=t[i-1]+a[i];
for(j=0;j<=i-k;j++)
if(max<t[i]-t[j]) {max=t[i]-t[j]; pi=j+1; pf=i;}
}
fprintf(fout,"%d %d %d",pi,pf,max);
fclose(fin);
fclose(fout);
return 0;
}