Cod sursa(job #3039490)
| Utilizator | Data | 28 martie 2023 16:59:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main() {
int N, sum = 0, l = 1, r = 1, ind = 0, smax;
fin >> N;
for (int i = 1; i <= N; i++) {
int x;
fin >> x;
sum += x;
if (i == 1)
smax = x;
if (sum > smax) {
l = ind + 1;
r = i;
smax = sum;
}
if (sum < 0) {
sum = 0;
ind = i;
}
}
fout << smax << ' ' << l << ' ' << r;
return 0;
}
