Cod sursa(job #1857986)
| Utilizator | Data | 26 ianuarie 2017 21:58:11 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <limits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, S;
int sum = 0, start, sf, ind;
fin >> n;
int bestSum = std::numeric_limits<int>::min();
for (int i=1;i<=n;i++)
{
fin >> S;
if (sum < 0)
{
sum = S;
ind = i;
}
else
sum += S;
if (bestSum < sum)
{
bestSum = sum;
start = ind;
sf = i;
}
}
fout << bestSum << " " << start << " " << sf;
return 0;
}
