Cod sursa(job #941147)
| Utilizator | Data | 18 aprilie 2013 01:39:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
fin >> n;
int a, lowi(1), i, j;
int cur(0), ans(-1<<30);
for (int k = 1; k <= n; ++k) {
fin >> a;
if (cur >= 0)
cur += a;
else {
cur = a;
lowi = k;
}
if (ans < cur) {
ans = cur;
i = lowi;
j = k;
}
}
fout << ans << ' ' << i << ' ' << j;
return 0;
}
