Cod sursa(job #3266195)
| Utilizator | Data | 6 ianuarie 2025 13:53:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int DIM = 6e6 + 5, INF = 2e9;
int a[DIM];
signed main()
{
int n;
fin >> n;
for(int i = 1; i <= n; i++)
fin >> a[i];
int start = -1, st = -1, dr = -1, s_crt = -1, s_max = -INF;
for(int i = 1; i <= n; i++)
{
if(s_crt < 0)
{
s_crt = 0;
start = i;
}
s_crt += a[i];
if(s_crt > s_max)
{
s_max = s_crt;
st = start;
dr = i;
}
}
fout << s_max << " " << st << " " << dr;
return 0;
}
