Cod sursa(job #1916116)
Utilizator | Data | 9 martie 2017 01:09:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, i, x, best, sum, sf, s, fin, finf;
f >> n;
best = -1e8;
sum = 0;
for(i = 1; i <= n; i++){
f >> x;
if( sum < 0 ){
sum = x;
s = i;
}
else
sum += x;
if(sum > best){
best = sum;
sf = s;
finf = i;
}
}
g << best << " " << sf << " " << finf;
return 0;
}