Cod sursa(job #1522901)
| Utilizator | Data | 12 noiembrie 2015 08:21:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, v[500000], k, j;
long s, smax;
f >> n;
for(int i = 1; i <= n; i++)
f >> v[i];
s = v[1];
if(s < 0)
s = 0;
smax = 0;
for(int i = 2; i <= n; i++)
{
s += v[i];
if(s > smax)
smax = s, j = i;
if(s < 0)
s = 0, k = i + 1;
}
g << smax << " " << k << " " << j;
return 0;
}
