Cod sursa(job #552164)
| Utilizator | Data | 11 martie 2011 19:19:22 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream.h>
int v[50002];
int main() {
int n,k,i,s=0,min=0,max,x=1,y,st=1;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for (i=1;i<=k;++i)
f>>v[i],v[i]+=v[i-1];
max=v[k],y=k;
for (i=k+1;i<=n;++i){
f>>v[i],v[i]+=v[i-1];
if (min>v[i-k])
min=v[i-k],st=i-k+1;
if (max<v[i]-min)
max=v[i]-min,x=st,y=i;
}
g<<x<<' '<<y<<' '<<max<<'\n';
return 0;
}
