Cod sursa(job #1864293)
| Utilizator | Data | 31 ianuarie 2017 18:04:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <iostream>
#define NM 6000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, v[NM];
int main()
{
int st, dr, indx, ends, maxx, s;
f >> n;
for(int i = 1; i <= n; ++i) f >> v[i];
indx = 1; s = v[1]; maxx = s;
for(int i = 2; i <= n; ++i)
{
if(s < 0)
{
s = v[i];
indx = i;
}
else s += v[i];
if(s > maxx)
{
maxx = s;
st = indx;
dr = i;
}
}
g << maxx << ' ' << st << ' ' << dr;
}
