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