Cod sursa(job #1415899)
Utilizator | Berbecariu Crina cri25 | Data | 6 aprilie 2015 20:24:11 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000001];
int main()
{
int n;
fin>>n;
for(int i=1;i<=n;++i)
fin>>a[i];
int st,stg;
int best = 0,sumbest = 0;
int dr;
for(int i=1;i<=n;++i)
{
best += a[i];
if(best < 0)
{
best = 0;
st = i;
}
if(best > sumbest)
sumbest = best, dr = i, stg = st;
}
fout<<sumbest<<" "<<stg + 1<<" "<<dr;
return 0;
}