Cod sursa(job #3304446)
| Utilizator | Data | 23 iulie 2025 16:15:44 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n, spCrt = 0, capatStCrt = 0, capatDrFinal = 1, capatStFinal = 1, sumMx = -2e9;
f >> n;
for (int i = 1; i <= n; i++)
{
int nr;
f >> nr;
spCrt += nr;
if (spCrt > sumMx)
{
sumMx = spCrt;
capatDrFinal = i;
capatStFinal = capatStCrt + 1;
}
if (spCrt < 0)
{
spCrt = 0;
capatStCrt = i;
}
}
g << sumMx << ' ' << capatStFinal << ' ' << capatDrFinal;
return 0;
}
