Cod sursa(job #3141354)
Utilizator | Cimpoesu Fabian George CimpoesuFabian | Data | 13 iulie 2023 18:26:37 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <stack>
#include <fstream>
using namespace std;
int main()
{
int x, n, s, smax, st, dr, p;
ifstream fin ("ssm.in");
fin >> n >> x;
s = smax = x;
st = dr = p = 1;
if (s < 0)
{
s = 0;
p = 2;
}
for (int i = 2; i <= n; i++)
{
fin >> x;
s += x;
if (s > smax)
{
smax = s;
st = p;
dr = i;
}
if (s < 0)
{
s = 0;
p = i + 1;
}
}
ofstream fout ("ssm.out");
fout << smax << " " << st << " " << dr;
fout.close();
}