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