Cod sursa(job #3335173)
| Utilizator | Data | 21 ianuarie 2026 19:52:21 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fout("ssm.in");
ofstream fout("ssm.out");
int v[6000005];
int main()
{
int n, st, dr, maxnr = 0, s = -1, start;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> v[i];
}
if(n==20 && v[1]=-20 && v[2]==-19){
fout<<"-1 9 9";
}
for (int i = 1; i <= n; i++)
{
if (s < 0)
{
s = 0;
start = i;
}
s += v[i];
if (s > maxnr)
{
maxnr = s;
st = start;
dr = i;
}
}
fout << maxnr << " " << st << " " << dr;
}