Cod sursa(job #3333901)
| Utilizator | Data | 15 ianuarie 2026 15:49:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, sum = 0, st, dr, maxx, strt = 0;
cin >> n;
maxx = -99999999;
vector <int> v(n);
for(int i = 0; i < n; i++) {
cin >> v[i];
}
for(int i = 0; i < n; i++) {
if(sum < 0) {
sum = 0;
strt = 1;
}
sum += v[i];
if(sum > maxx) {
maxx = sum;
st = strt;
dr = i;
}
}
cout << maxx << " " << dr << " " << st;
}
