Pagini recente » Cod sursa (job #646761) | Cod sursa (job #2388848) | Cod sursa (job #56587) | Istoria paginii runda/oji_go_11-12_3 | Cod sursa (job #1935461)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int n,a[100005],dp[100005],mx;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
///1+n
dp[1]=a[1]+a[n];
for(int i=3;i<=n-2;i++)
dp[i]=max(dp[i-1],dp[i-3]+a[i]+a[i-1]);
mx=max(mx,dp[n-2]);
///1+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]);
mx=max(mx,dp[n-1]);
///2+3
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]);
mx=max(mx,dp[n]);
fout<<mx;
return 0;
}