Cod sursa(job #307470)
Utilizator | Data | 24 aprilie 2009 10:43:10 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include<fstream.h>
long long k,z,n,i,c,y,s,yy,x,xx,max;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
s=0;
max=-200000000;
for (i=1;i<=n;i++)
{
f>>c;
if (s<0){s=c;z=i;}
else s=s+c;
if(max<s&&i-z+1>=k){max=s;xx=z;yy=i;}
}
g<<max<<' '<<xx<<' '<<yy<<'\n';
g.close();
return 0;
}