Pagini recente » Cod sursa (job #2150285) | Cod sursa (job #2311271) | Cod sursa (job #840179) | Clasament Summer Challenge 2007 | Cod sursa (job #1927748)
#include <fstream>
using namespace std;
int n,i,v[100005],w[100005],s;
int main()
{
ifstream f("oo.in");
ofstream g("oo.out");
f>>n;
for(i=1; i<=n; i++) f>>v[i];
w[2]=w[3]=w[4]=v[1]+v[2];
for(i=5; i<n; i++)
w[i]=max(w[i-1],v[i]+v[i-1]+w[i-3]);
s=w[n-1];
w[0]=w[1]=w[2]=0;
for(i=3; i<=n; i++)
w[i]=max(w[i-1], v[i]+v[i-1]+w[i-3]);
s=max(s,w[n]);
w[1]=w[2]=w[3]=v[1]+v[n];
for(i=4; i<n-1; i++)
w[i]=max(w[i-1], v[i]+v[i-1]+w[i-3]);
s=max(s,w[n-2]);
g<<s<<'\n';
f.close(); g.close();
return 0;
}