Mai intai trebuie sa te autentifici.
Cod sursa(job #3273283)
| Utilizator | Data | 1 februarie 2025 15:04:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <bits/stdc++.h>
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int n, v[6000001], best;
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
int bestSum = v[1], s, st = 0, f = 0;
for (int i = 1; i <= n; ++i) {
if (best < 0) {
best = v[i];
s = i;
} else {
best += v[i];
}
if (bestSum < best) {
bestSum = best;
st = s;
f = i;
}
}
cout << bestSum << " " << st << " " << f;
return 0;
}
