Cod sursa(job #1239153)
| Utilizator | Data | 8 octombrie 2014 13:51:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
int main() {
ifstream fin("ssm.in");
ofstream fout("ssm.out");
size_t n;
fin >> n;
size_t left, right, start, i;
int x, sum, maxim;
for (i = 1, left = right = 0, sum = 0, maxim = 0, start = 1;
i <= n; ++i) {
fin >> x;
sum += x;
if (sum < 0) {
start = i + 1;
sum = 0;
}
else if (sum > maxim) {
maxim = sum;
left = start;
right = i;
}
}
fout << maxim << ' ' << left << ' ' << right << endl;
fin.close();
fout.close();
return 0;
}
