Cod sursa(job #2793115)
Utilizator | Data | 2 noiembrie 2021 23:17:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int main()
{
int n, i, x, S = -1, smax = -100000, inc, sf;
cin >> n;
for(i = 1; i <= n; i++)
{
cin >> x;
if(S < 0)
{
S = x;
inc = i;
}
else
S = S + x;
if(S > smax)
{
smax = S;
sf = i;
}
}
cout << smax << " " << inc << " " << sf;
return 0;
}