Cod sursa(job #1439301)
Utilizator | Data | 22 mai 2015 08:35:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
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 mx, s, ltL, ltR, limitL;
int main()
{
int n;
f >> n;
for (int i = 0; i <= n; i++) {
int x;
f >> x;
s += x;
if (s < 0) {
s = 0;
limitL = i + 1;
}
if (mx < s) {
mx = s;
ltL = limitL;
ltR = i;
}
}
g << mx << " " << ltL << " " << ltR;
return 0;
}