Pagini recente » Cod sursa (job #2030084) | Cod sursa (job #668815) | Cod sursa (job #2062138) | Cod sursa (job #372860) | Cod sursa (job #3231276)
#include <fstream>
using namespace std;
ifstream cin("oo.in");
ofstream cout("oo.out");
int dp[100001],v[100001];
int main()
{
int n,i,rez=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
dp[1]=0;///n 1
dp[2]=v[1]+v[n];
rez=dp[2];
for(i=3;i<=n-1;i++)
{
dp[i]=max(dp[i-1],dp[i-3]+v[i-2]+v[i-1]);
rez=max(rez,dp[i]);
}
dp[1]=dp[2]=0;///1 2
for(i=3;i<=n;i++)
{
rez=max(rez,dp[i]);
dp[i]=max(dp[i-1],dp[i-3]+v[i-2]+v[i-1]);
}
cout<<rez;
return 0;
}