Cod sursa(job #455721)
| Utilizator | Data | 14 mai 2010 08:44:06 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<iostream.h>
#include<fstream.h>
ifstream f("secv2.in");
ofstream g("secv2.out");
long long int n,scur,sk,k,i,smin,pmin,smax,pmax,v[50006];
int main()
{f>>n>>k;
for(i=1;i<=k;i++) {f>>v[i];
scur+=v[i];}
smin=0; pmin=1; smax=scur; pmax=k;
for(i=k+1;i<=n;i++)
{f>>v[i];
scur+=v[i];
sk+=v[i-k];
if(sk<smin)
{smin=sk;
pmin=i-k;}
if(scur-smin>smax)
{smax=scur-smin;
pmax=i;
}
}
g<<pmin+1<<" "<<pmax<<" "<<smax;
f.close(); g.close();
return 0;
}
