Cod sursa(job #2714167)
| Utilizator | Data | 1 martie 2021 13:44:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n;
int main()
{
fin >> n;
int x;
fin >> x;
int s = x, startI = 1, stopI = 1, pos;
int maxim = x;
for (int i = 2; i <= n; i++)
{
fin >> x;
if (s >= 0)
{
s += x;
}
else
{
s = x;
pos = i;
}
if (s > maxim)
{
maxim = s;
startI = pos;
stopI = i;
}
}
fout << maxim << ' ' << startI << ' ' << stopI;
fin.close();
fout.close();
return 0;
}