Pagini recente » Cod sursa (job #1373314) | Monitorul de evaluare | Cod sursa (job #1113655) | Cod sursa (job #1874397) | Cod sursa (job #1933741)
#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;
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]);
dp[1]=0;
for(i=2;i<=n-1;i++)
dp[i]=max(dp[i-1],a[i]+a[i-1]+dp[i-3]);
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]);
fout<<dp[n];
return 0;
}