Pagini recente » Cod sursa (job #1266910) | Cod sursa (job #2855193) | Cod sursa (job #2374081) | Cod sursa (job #2770273) | Cod sursa (job #2385498)
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int n,k,a[13],v[100004],d[100004],maxim;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
d[2]=v[1]+v[2];
d[3]=max(d[2],v[3]+v[2]);
for(int i=4;i<n;i++)
d[i]=max(d[i-1],d[i-3]+v[i-1]+v[i]);
maxim=max(d[n-1],maxim);
d[2]=0;
d[3]=v[2]+v[3];
for(int i=4;i<=n;i++)
d[i]=max(d[i-1],d[i-3]+v[i-1]+v[i]);
maxim=max(maxim,d[n]);
d[3]=0;
d[2]=0;
d[4]=v[4]+v[5];
for(int i=5;i<n-1;i++)
d[i]=max(d[i-1],d[i-3]+v[i-1]+v[i]);
fout<<max(maxim,d[n-2]+v[1]+v[n]);
return 0;
}