Cod sursa(job #2683853)
Utilizator | Data | 12 decembrie 2020 10:35:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
using namespace std;
int n, i, v[6000001], dp[6000001], nrmax, nr, l1, l2;
int main()
{
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
dp[1]=v[1];
for(i=2; i<=n; i++)
{
if(dp[i-1]<0)
{
dp[i]=v[i];
nr=i;
}
else
dp[i]=dp[i-1]+v[i];
if(dp[i]>nrmax)
{
nrmax=dp[i];
l1=nr;
l2=i;
}
}
cout<<nrmax<<" "<<l1<<" "<<l2;
return 0;
}