Cod sursa(job #2440614)
Utilizator | Data | 18 iulie 2019 20:40:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, item, sum, bestSum, beginIndex, endIndex, previousIndex = 0;
sum = 0;
bestSum = -2147483648;
fin >> n;
for (int i = 0; i < n; i++)
{
fin >> item;
if (sum < 0)
{
sum = item;
previousIndex = i;
}
else
{
sum += item;
}
if (sum > bestSum)
{
bestSum = sum;
beginIndex = previousIndex;
endIndex = i;
}
}
fout << bestSum << " " << beginIndex << " " << endIndex;
return 0;
}