Cod sursa(job #3165395)
| Utilizator | Data | 6 noiembrie 2023 09:12:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000005],S,smax,pozi,pozibun,pozf;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
S=v[1];
pozi=1;
pozf=1;
pozibun=1;
for(int i=2;i<=n;i++)
{
if(S+v[i]<v[i])
{
S=v[i];
pozi=i;
}
else
S+=v[i];
if(smax<S)
{
smax=S;
pozibun=pozi;
pozf=i;
}
}
fout<<smax<<' '<<pozibun<<' '<<pozf;
return 0;
}
