Cod sursa(job #2154831)
| Utilizator | Data | 7 martie 2018 12:36:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int maxSum = -int(2e9), sum, i, n, x, beg, endi, idx;
int main()
{
in >> n;
for(int i = 1; i <= n; i++) {
in >> x;
if(sum < 0) sum = x, idx = i;
else sum += x;
if(maxSum < sum) maxSum = sum, beg = idx; endi = i;
}
out << maxSum << " " << beg << " " << endi;
in.close(); out.close();
return 0;
}
