Cod sursa(job #1739260)
Utilizator | Don Juan donjuan99 | Data | 9 august 2016 08:57:30 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, x, i, s, sum, left, right, idx;
fin >> n;
sum = s = -(2e9);
idx = 1;
for (i = 1; i <= n; ++ i)
{
fin >> x;
if (s < 0)
{
s = x;
idx = i;
}
else
{
s += x;
if (s > sum)
{
sum = s;
left = idx;
right = i;
}
}
}
fout << sum << " " << left << " " << right << "\n";
fin.close();
fout.close();
return 0;
}