Cod sursa(job #1807377)
Utilizator | Data | 16 noiembrie 2016 14:28:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#define NM 6000005
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, v[NM], best, st, dr;
int main()
{
int sum = 0, indx = 1;
f >> n;
for(int i = 1; i <= n; ++i)
f >> v[i];
for(int i = 1; i <= n; ++i)
{
if(sum < 0)
sum = v[i], indx = i;
else sum += v[i];
if(best < sum)
best = sum, st = indx, dr = i;
}
g << best << ' ' << st << ' ' << dr << '\n';
}