Cod sursa(job #3152152)
Utilizator | Stan Rares RaresStan | Data | 24 septembrie 2023 09:12:19 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int v[6000005];
int main() {
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, start = 1, end = 1, s = 0, maxx = 0, start1 = 1;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i <= n; i++) {
if (s < 0) {
s = 0;
start1 = i;
}
s += v[i];
if (s > maxx) {
maxx = s;
start = start1;
end = i;
}
}
cout << maxx << " " << start << " " << end;
return 0;
}