Cod sursa(job #308364)
| Utilizator | Data | 26 aprilie 2009 21:53:57 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream.h>
long long 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=c;
f>>c;
if (s<0 && i-z+1>k){s=c;z=i-1;s-=u;}
else s=s+c;
if(max<s&&i-z+1>=k){max=s;xx=z;yy=i;}
}
g<<xx<<' '<<yy<<' '<<max<<'\n';
g.close();
return 0;
} 