Cod sursa(job #961580)
| Utilizator | Data | 12 iunie 2013 17:06:22 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int a[50005],smax,n,i,j,sn,k,s,iin,ifin;
int main ()
{
f>>n>>k;
for(i=1;i<=n;i++)
{f>>a[i]; if(i<=k) sn+=a[i];}
ifin=iin=1;
for(i=1;i<=n;i++)
{
if(s>=0) { s+=a[i]; }
else if(s<0) {s=a[i]; iin=i;}
if(s>smax) {smax=s; ifin=i;}
}
if(ifin-iin<k)
{g<<1<<" "<<k<<" "<<sn;}
g<<iin<<" "<<ifin<<" "<<smax<<" ";
return 0;
}
