Cod sursa(job #95133)
| Utilizator | Data | 27 octombrie 2007 12:19:10 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream.h>
#define dim 50001
long v[dim];
int main()
{ifstream f("secv2.in");
ofstream g("secv2.out");
unsigned long n,k,i,j,poz1,poz2,nn;
long max=-2000000000;
f>>n>>k;
nn=n-k;
v[0]=0;
for(i=1;i<=n;i++)
{f>>v[i];
v[i]=v[i]+v[i-1];
}
for(i=0;i<=nn;i++)
for(j=(i+k);j<=n;j++)
if((v[j]-v[i])>max) {max=v[j]-v[i];poz1=i+1;poz2=j;}
f.close();
g<<poz1<<" "<<poz2<<" "<<max<<'\n';
g.close();
return 0;
}
