Pagini recente » Cod sursa (job #1400638) | Cod sursa (job #643146) | Cod sursa (job #43400) | Cod sursa (job #197353) | Cod sursa (job #1041789)
#include<fstream>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
int n,a[100003],b[4][100003],i,j,k;
int main()
{
f>>n;
for(i=1;i<=n;i++) f>>a[i];
b[1][2]=a[1]+a[2];
b[2][3]=a[2]+a[3];
b[3][4]=a[3]+a[4];
for(i=3;i<n;i++) b[1][i]=max(b[1][i-1],b[1][i-3]+a[i-1]+a[i]);
for(i=4;i<=n;i++) b[2][i]=max(b[2][i-1],b[2][i-3]+a[i-1]+a[i]);
a[n+1]=a[1];
for(i=5;i<=n+1;i++) b[3][i]=max(b[3][i-1],b[3][i-3]+a[i-1]+a[i]);
b[1][n]=b[1][n-1];
b[3][n]=b[3][n+1];
g<<max(max(b[1][n],b[2][n]),b[3][n]);
return 0;
}