Pagini recente » Cod sursa (job #1201430) | Cod sursa (job #1211355) | Cod sursa (job #1201020) | Cod sursa (job #1118042) | Cod sursa (job #2532343)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("oo.in");
ofstream g ("oo.out");
int n;
int sum[100005][4];
int vek[100005];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
{
f>>vek[i];
}
vek[n+1]=vek[1];
vek[n+2]=vek[2];
sum[2][1] = vek[1]+vek[2];
sum[3][2] = vek[3]+vek[2];
sum[4][3] = vek[3]+vek[4];
for(int i=3;i<=n-1;++i)
{
sum[i][1]=max(sum[i-1][1], sum[i-3][1]+vek[i]+vek[i-1]);
}
for(int i=4;i<=n;++i)
{
sum[i][2]=max(sum[i-1][2], sum[i-3][2]+vek[i]+vek[i-1]);
}
for(int i=5;i<=n+1;++i)
{
sum[i][3]=max(sum[i-1][3], sum[i-3][3]+vek[i]+vek[i-1]);
}
g<<max(sum[n-1][1], max(sum[n][2], sum[n+1][3]));
return 0;
}