Pagini recente » Cod sursa (job #1191891) | Cod sursa (job #3175816) | Cod sursa (job #2856252) | Cod sursa (job #2064660) | Cod sursa (job #1979123)
#include <fstream>
#define MAX 100001
using namespace std;
ifstream fi("oo.in");
ofstream fo("oo.out");
int dp[MAX],x[MAX],n,i,rez;
int main()
{
fi>>n;
for (i=1; i<=n; i++)
fi>>x[i];
dp[1]=x[n-1]+x[n];
dp[2]=x[n]+x[1];
for (i=3; i<=7; i++)
dp[i]=x[i-2]+x[i-1];
for (i=8; i<=n; i++)
dp[i]=max(max(dp[i-4],dp[i-5]),max(dp[i-6],dp[i-7]))+x[i-2]+x[i-1];
for (i=1; i<=n; i++)
rez=max(rez,dp[i]);
fo<<rez;
fi.close();
fo.close();
return 0;
}