Cod sursa(job #2698736)
| Utilizator | Data | 22 ianuarie 2021 21:35:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int A[6000001], n;
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> A[i];
int st, dr, Smax = -2147483647, S = -1, start;
for (int i = 1; i <= n; ++i)
{
if (S < 0)
S = 0, start = i;
S += A[i];
if (S > Smax)
Smax = S, st = start, dr = i;
}
fout << Smax << " ";
fout << st << " " << dr;
return 0;
}
