Cod sursa(job #2869474)
Utilizator | Data | 11 martie 2022 15:50:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout("ssm.out");
int n, x, sum = -1, sum_max = -2e9;
int poz_st, poz_dr, sol_st, sol_dr;
int main() {
fin >> n;
poz_st = 1;
for (int i = 1; i <= n; i++) {
fin >> x;
if (sum < 0)
sum = 0, poz_st = i;
sum += x;
poz_dr = i;
if (sum > sum_max) {
sum_max = sum;
sol_st = poz_st;
sol_dr = poz_dr;
}
}
fout << sum_max << ' ' << sol_st << ' ' << sol_dr;
fin.close();
fout.close();
return 0;
}