Cod sursa(job #2323968)
| Utilizator | Data | 20 ianuarie 2019 09:33:32 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#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;
for(int i = 1; i <= n; ++i){
int x;
cin >> x;
if(i == 1){
st = 1;
dr = 1;
dp = x;
maxx = max(dp ,maxx);
}
else {
if(dp + x < x){
st = i;
}
else dr = i - 1;
dp = max(dp + x, x);
maxx = max(dp, maxx);
}
}
cout << maxx << ' ' << st << ' ' << dr << ' ' << '\n';
return 0;
}
