Cod sursa(job #2222461)
Utilizator | Data | 17 iulie 2018 00:18:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int N, i, f, l, ind = 0;
long long sum, mi, ma, x;
fin >> N >> x;
sum = x;
mi = 0;
ma = x;
for (i = 2; i <= N; i++) {
fin >> x;
sum += x;
if (ma < sum - mi) {
ma = sum - mi;
l = i;
f = ind + 1;
}
if (mi > sum) {
mi = sum;
ind = i;
}
}
fout << ma << " " << f << " " << l;
}