Cod sursa(job #716255)
| Utilizator | Data | 18 martie 2012 15:14:36 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f ("secv2.in");
ofstream g ("secv2.out");
int k,n,a[50005],i,j,max1=-1250000001,s,l,x1,x2;
int main()
{
f>>n>>k;
for(i=0;i<n;i++) f>>a[i];
f.close();
x1=0,x2=0;
s=a[0];
for(i=1,l=1;i<n;i++)
{
s+=a[i]; l++;
if(s>max1 && l>=k) {max1=s; x2=i;}
if(s<0 && n-i+l-1>k) {s=0;x1=i+1; l=0;}
}
g<<x1+1<<" "<<x2+1<<" "<<max1<<"\n";
}
