Cod sursa(job #3285373)
Utilizator | Data | 12 martie 2025 19:46:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n , v[6000001] , s = 0, dr = 0, st = 0 ,smax = -2e9 , incepe;
int main()
{
fin >> n;
for(int i = 1 ; i <= n ; i++)
fin >> v[i];
for(int i = 1 ; i <= n ; i++)
{
s = s + v[i];
if(s <= 0)
{
incepe = i;
s = 0;
}
else if(s > smax)
{
smax = s;
dr = i;
st = incepe + 1;
}
}
fout << smax <<" " << st <<" " << dr;
}