Cod sursa(job #2825367)
| Utilizator | Data | 4 ianuarie 2022 16:59:39 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long n,i,a[6000005],dp[6000005],smax,in[6000005],sf;
int main()
{
cin>>n;
for(i=1;i<=n;i++)cin>>a[i];
dp[1]=a[1];
in[1]=0;
for(i=2;i<=n;i++)
{
dp[i]=max(dp[i-1]+a[i],a[i]);
}
for(i=1;i<=n;i++)
{
if(dp[i]<=dp[i-1]+dp[i])
{
in[i]=in[i-1];
}
else in[i]=i;
}
smax=0;
for(i=1;i<=n;i++)
{
if(smax<dp[i]){smax=dp[i];
sf=i;}
}
cout<<smax<<" "<<in[sf]<<" "<<sf;
return 0;
}
