Cod sursa(job #3304543)
| Utilizator | Data | 24 iulie 2025 18:03:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n;
f >> n;
int spCrt = 0, leftCrt = 0, inceputSecv = 1, finalSecv = 1, ssm = -2e9;
for (int i = 1; i <= n; i++)
{
int nr;
f >> nr;
spCrt += nr;
if (spCrt > ssm)
{
ssm = spCrt;
inceputSecv = leftCrt + 1;
finalSecv = i;
}
if (spCrt < 0)
{
spCrt = 0;
leftCrt = i;
}
}
g << ssm << ' ' << inceputSecv << ' ' << finalSecv;
return 0;
}
