Cod sursa(job #2869373)
| Utilizator | Data | 11 martie 2022 14:39:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, x, s, sum, best, pozi, pozf;
int main()
{
fin>>n;
for (int i=1; i<=n; i++) {
fin>>x;
if (x > sum + x) {
sum = x;
pozi = i;
}
else {
sum = sum + x;
}
if (best < sum) {
best = sum;
pozf = i;
}
}
fout<<best<<" "<<pozi<<" "<<pozf;
return 0;
}
