Pagini recente » Cod sursa (job #2608297) | Cod sursa (job #659284) | Cod sursa (job #57103) | Cod sursa (job #482075) | Cod sursa (job #1494668)
#include<fstream>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
int d[100001],v[100001];
int main()
{
int n,sol=0;
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
d[2]=d[3]=d[4]=v[1]+v[2];
for(int i=5;i<n;++i)
d[i]=max(d[i-1],d[i-3]+v[i]+v[i-1]);
sol=max(sol,d[n-1]);
d[0]=d[1]=d[2]=0;
for(int i=3;i<=n;++i)
d[i]=max(d[i-1],d[i-3]+v[i]+v[i-1]);
sol=max(sol,d[n]);
d[1]=d[2]=d[3]=v[1]+v[n];
for(int i=4;i<n-1;++i)
d[i]=max(d[i-1],d[i-3]+v[i]+v[i-1]);
sol=max(sol,d[n-2]);
g<<sol;
return 0;
}