Cod sursa(job #496522)
Utilizator | Data | 29 octombrie 2010 15:36:48 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
const long N=50000;
long v[N];
ifstream in("secv2.in");
ofstream out("secv2.out");
int main()
{
long n,k,i,i1,i2,i3,s=0,smax;
in>>n;
in>>k;
for(i=1;i<=n;i++)
in>>v[i];
smax=v[1];
for(i=1;i<=n;i++)
{
if(s<0)
{
s=0;
i1=i;
}
s+=v[i];
if(s>=smax&&i-i1>=k)
{
smax=s;
i2=i;
i3=i1;
}
}
out<<i3<<" "<<i2<<" "<<smax;
return 0;
}