Mai intai trebuie sa te autentifici.
Cod sursa(job #2965013)
Utilizator | Data | 14 ianuarie 2023 11:34:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,v[6000011],i,sp[6000011],maxim,p1,p2,suma;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>v[i];
sp[i]=max(v[i],v[i]+sp[i-1]);
}
maxim=v[1];
for(i=1; i<=n; i++)
{
if(maxim<=sp[i])
{
maxim=sp[i];
p2=i;
}
}
p1=1;
for(i=1;i<=n; i++)
{
if(sp[i]!=sp[i-1]+v[i])
{
suma=v[i];
p1=i;
}
else
suma=suma+v[i];
if(i==p2 && suma==maxim)
break;
}
fout<<maxim<<' '<<p1<<' '<<p2;
return 0;
}