Cod sursa(job #1922986)
| Utilizator | Data | 10 martie 2017 20:05:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N, maxim, sum, st, reper, dr, v;
int main()
{
f >> N;
maxim = -2000000000;
for (int i = 0; i < N; i++){
f >> v;
if (sum < 0){
sum = v;
reper = i;
}
else
sum += v;
if (sum > maxim){
maxim = sum;
dr = i;
st = reper;
}
}
g << maxim << " " << st + 1 << " " << dr + 1;
return 0;
}
