Cod sursa(job #3339294)
| Utilizator | Data | 7 februarie 2026 12:18:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
#define minn 1e9
using namespace std;
int n, s, x, st = 1, dr = 1, stf = 1, maxi;
int main()
{
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
cin >> n;
cin >> x;
s = maxi = x;
for (int i = 2; i <= n; i++)
{
cin >> x;
if (s + x > x) s += x;
else {
s = x;
st = i;
}
if (s > maxi) {
maxi = s;
stf = st;
dr = i;
}
}
cout << maxi << " " << stf << " " << dr;
return 0;
}