Cod sursa(job #3166072)
Utilizator | Data | 7 noiembrie 2023 17:24:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000005],n,smax,s,st,dr,stfin,drfin;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
for(int i=2; i<=n; i++)
{
if(s+v[i]>v[i])
s+=v[i];
else
{
s=v[i];
st=i;
}
if(s>smax)
{
smax=s;
stfin=st;
drfin=i;
}
}
fout<<smax<<" "<<stfin<<" "<<drfin;
}