Cod sursa(job #3304424)
| Utilizator | Data | 23 iulie 2025 13:40:47 | |
|---|---|---|---|
| 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");
const int NMAX = 6000001;
int main()
{
int n;
f >> n;
int mxSum = -2e9, lftBound = 1, sum = 0, finalL, finalR;
for (int i = 1; i <= n; i++)
{
int nr;
f >> nr;
sum += nr;
if (sum > mxSum)
{
mxSum = sum;
finalL = lftBound;
finalR = i;
}
if (sum < 0)
{
lftBound = i + 1;
sum = 0;
}
}
g << mxSum << ' ' << finalL << ' ' << finalR;
return 0;
}
