Cod sursa(job #961566)
| Utilizator | Data | 12 iunie 2013 16:53:25 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 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];
ifin=iin=1;
for(i=1;i<=n;i++)
{
s+=a[i];
if(s>smax) { smax=s; ifin=i;}
else if(s<0) {s=a[i]; iin=i;}
}
if(ifin-iin<k) { smax=0; for(i=1;i<=k;i++) smax+=a[i]; g<<1<<" "<<k<<" "<<smax;}
g<<iin<<" "<<ifin<<" "<<smax<<" ";
return 0;
}
