Pagini recente » Cod sursa (job #2989382) | Cod sursa (job #494473) | Cod sursa (job #746961) | Cod sursa (job #2853930) | Cod sursa (job #1979143)
#include <fstream>
#define MAX 100001
using namespace std;
ifstream fi("oo.in");
ofstream fo("oo.out");
int dp[MAX],x[MAX],n,i,rez,maxim,j;
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];
dp[0]=0;
for (i=3; i<n; i++)
{
maxim=0;
for (j=i-7; j<=i-3; j++)
if (j>=0)
maxim=max(maxim,dp[j]);
dp[i]=maxim+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;
}