Cod sursa(job #2860818)
| Utilizator | Data | 3 martie 2022 09:36:55 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| 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, a, s = 0, in = 1, maxx, x = 1, y = 1;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
s = maxx = v[1];
for (int i = 2; i <= n; i++) {
if (s < 0) {
in = i;
s = 0;
}
s = s + v[i];
if (s > maxx) {
maxx = s;
x = in;
y = i;
}
}
cout << maxx << " " << x << " " << y;
return 0;
}
