Cod sursa(job #1910549)
| Utilizator | Data | 7 martie 2017 17:25:27 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n, x, sum, maxSum, idx, inc, sf;
fin >> n >> x;
sum = maxSum = x;
for (int i=2; i<=n; i++) {
fin >> x;
if (sum < 0) sum = x, idx = i;
else sum += x;
if (maxSum < sum) maxSum = sum, inc = idx, sf = i;
}
fout << maxSum << ' ' << inc << ' ' << sf;
return 0;
}
