Cod sursa(job #3297036)
Utilizator | Data | 20 mai 2025 16:01:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int v[1001], a, s = 0, smax = 0, dr, st;
cin >> a;
for (int i = 1; i <= a; i++){
cin >> v[i];
}
for (int i = 1; i <= a; i++){
s = max(0, s + v[i]);
if (s == v[i]){
dr = i;
}
smax = max(s, smax);
if (smax == s){
st = i;
}
}
cout << smax << ' ' << dr << ' ' << st;
return 0;
}