Cod sursa(job #308369)
Utilizator | Data | 26 aprilie 2009 22:03:10 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream.h>
long long a[501],u,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;
z=1;
for (i=1;i<=n;i++)
{
u=a[i];
f>>a[i];
if (s<0 && i-z+1>k){s=a[i];z=i;s-=u;}
else s=s+a[i];
if(max<s&&i-z+1>=k){max=s;xx=z;yy=i;}
}
max=0;
for (i=xx;i<=yy;i++)
max+=a[i];
g<<xx<<' '<<yy<<' '<<max<<'\n';
g.close();
return 0;
}