Pagini recente » Cod sursa (job #3153381) | Cod sursa (job #75794) | Cod sursa (job #185690) | Cod sursa (job #550487) | Cod sursa (job #3231063)
#include <fstream>
using namespace std;
ifstream cin ("oo.in");
ofstream cout ("oo.out");
int dp[100001],v[100001];
int main()
{
int n,i,max1=-1,max2=-1,max3=-1;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
///1 si n
dp[1]=dp[n]=dp[2]=dp[3]=v[1]+v[n];
for(i=4;i<=n-2;i++)
dp[i]=max(dp[i-1],dp[i-3]+v[i]+v[i-1]);
max1=dp[n-2];
///1 si 2
dp[1]=0;
dp[4]=dp[2]=dp[3]=v[1]+v[2];
for(i=5;i<=n-1;i++)
dp[i]=max(dp[i-1],dp[i-3]+v[i]+v[i-1]);
max2=dp[n-1];
///2 si 3
dp[1]=dp[2]=0;
dp[3]=dp[4]=dp[5]=v[2]+v[3];
for(i=6;i<=n;i++)
dp[i]=max(dp[i-1],dp[i-3]+v[i]+v[i-1]);
max3=dp[n];
int ans=max(max1, max(max2,max3));
cout<<ans;
return 0;
}