Cod sursa(job #1592348)
Utilizator | Data | 7 februarie 2016 15:02:05 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,k;
int main()
{
int best=-1250000001,i,aux=0,s=0,d=0,sum=0,x,nr=0;
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>x;
if(sum<0)
sum+=x,aux=i,nr=1;
else
sum+=x,nr++;
if(best<sum && nr>=k)
best=sum,s=aux,d=i;
}
fout<<best<<" "<<s<<" "<<d<<" ";
return 0;
}