Cod sursa(job #1827987)
Utilizator | Data | 12 decembrie 2016 17:41:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
using namespace std;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, i, best, sum = 0, l, r, pos, nr;
best = -2000000000;
cin>>n;
for(i = 1; i <= n; ++i){
cin>>nr;
if(sum < 0){
sum = nr;
pos = i;
} else
sum += nr;
if(sum > best){
best = sum;
l = pos;
r = i;
}
}
cout<<best<<" "<<l<<" "<<r;
return 0;
}