Cod sursa(job #1862347)
| Utilizator | Data | 29 ianuarie 2017 19:55:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, sum = 0, p1 = 1, nr, maxim = -0x3f3f3f3f, p2, p3;
fin >> n;
for (int i = 1; i <= n; ++i) {
fin >> nr;
if (sum + nr >= nr){
sum += nr;
} else {
p1 = i;
sum = nr;
}
if (sum > maxim) {
maxim = sum;
p2 = p1;
p3 = i;
}
}
fout << maxim << ' ' << p2 << ' ' << p3;
return 0;
}
