Cod sursa(job #3333874)
| Utilizator | Data | 15 ianuarie 2026 15:22:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int main() {
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, maxx = -200000000, st, dr, s = 0, start;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) {
cin >> v[i];
if (s < 0) {
s = 0;
start = i;
}
s += v[i];
if (s > maxx) {
maxx = s;
st = start;
dr = i;
}
}
cout << maxx << " " << st << " " << dr;
}
