Pagini recente » Cod sursa (job #2876474) | Cod sursa (job #1230304) | Cod sursa (job #67263) | Cod sursa (job #2495798) | Cod sursa (job #1933747)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int a[100001],dp[100001];
int main()
{
int n,i,sol=0;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
dp[1]=a[1]+a[n];
for(i=3;i<=n-2;i++)
dp[i]=max(dp[i-1],a[i]+a[i-1]+dp[i-3]);
sol=max(sol,dp[n-2]);
dp[1]=0;
for(i=2;i<=n-1;i++)
dp[i]=max(dp[i-1],a[i]+a[i-1]+dp[i-3]);
sol=max(sol,dp[n-1]);
dp[1]=0;dp[2]=0;
for(i=3;i<=n;i++)
dp[i]=max(dp[i-1],a[i]+a[i-1]+dp[i-3]);
sol=max(sol,dp[n]);
fout<<sol;
return 0;
}