Pagini recente » Cod sursa (job #2085183) | Cod sursa (job #2224814) | Cod sursa (job #2013422) | Cod sursa (job #1737963) | Cod sursa (job #1933914)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
const int Nmax=100000+5;
int n;
int a[Nmax],dp[Nmax];
int main()
{
int sol=0;
fin>>n;
for(int i=1;i<=n;++i)fin>>a[i];
dp[1]=a[1]+a[n];
for(int i=2;i<=n-2;++i)
dp[i]=max(dp[i-1],dp[i-3]+a[i]+a[i-1]);
sol=max(sol,dp[n-2]);
dp[1]=0;
for(int i=2;i<=n-1;++i)
dp[i]=max(dp[i-1],dp[i-3]+a[i]+a[i-1]);
sol=max(dp[n-1],sol);
dp[1]=0;dp[2]=0;
for(int i=3;i<=n;++i)
dp[i]=max(dp[i-1],dp[i-3]+a[i]+a[i-1]);
sol=max(dp[n],sol);
fout<<sol;
return 0;
}