Cod sursa(job #3127187)
| Utilizator | Data | 7 mai 2023 13:17:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n, pozi, pozf, sumi, MaxSumi, p1, p2, A[6000005];
int main()
{
f >> n;
for(long long i = 1; i <= n; i ++)f >> A[i];
for(long long i = 1; i <= n; i ++)
{
if(sumi <= 0)sumi = 0, pozi = i;
sumi += A[i]; pozf = i;
if(sumi > MaxSumi)
{
MaxSumi = sumi;
p1 = pozi;
p2 = pozf;
}
}
g << MaxSumi << " " << p1 << " " << p2;
return 0;
}
