Cod sursa(job #2189915)
Utilizator | Nisioi Ciprian CipiNis | Data | 29 martie 2018 13:00:59 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int N, s, i;
int bestSum = -int(2e9), sum = 0, st, sf, idx;
fin >> N;
for (i = 1; i <= N; ++i) {
fin >> s;
if (sum < 0)
sum = s, idx = i;
else sum += s;
if (bestSum < sum)
bestSum = sum, st = idx, sf = i;
}
fout << bestSum << ' ' << st << ' ' << sf << '\n';
fin.close();
fout.close();
return 0;
}