Cod sursa(job #2323980)
| Utilizator | Data | 20 ianuarie 2019 09:46:51 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.99 kb |
#include <iostream>
#include <climits>
using namespace std;
//ifstream cin("ssm.in");
//ofstream cout("ssm.out");
int main()
{
int n;
cin >> n;
int maxx = LONG_MIN, dp = 0, st = 0, dr = 0;
int stM = 0, drM = 0;
for(int i = 1; i <= n; ++i)
{
int x;
cin >> x;
if(i == 1)
{
st = 1;
dr = 1;
dp = x;
if(dp > maxx)
{
maxx = dp;
stM = st;
drM = dr;
}
}
else
{
if(dp + x < x)
{
st = i;
dr = i;
dp = x;
}
else
{
dr = i;
dp = dp + x;
}
if(dp > maxx)
{
maxx = dp;
stM = st;
drM = dr;
}
}
}
cout << maxx << ' ' << stM << ' ' << drM << ' ' << '\n';
return 0;
}
