Cod sursa(job #2784799)
| Utilizator | Data | 17 octombrie 2021 13:33:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long best = -2e10, sum = -1, st = -1, st1 , dr=-1;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (sum < 0) {
sum = 0;
st = i;
}
sum += x;
if (best < sum) {
best = sum;
st1 = st;
dr = i;
}
}
cout << best <<' ' << st1<<' ' << dr;
}