Pagini recente » Cod sursa (job #2492433) | Cod sursa (job #1894828) | Cod sursa (job #1237524) | Cod sursa (job #896330) | Cod sursa (job #1737300)
#include <fstream>
#define nmax 100001
using namespace std;
ifstream in("oo.in");
ofstream out("oo.out");
int n,v[nmax],vs[nmax],s=0;
void citire()
{
in>>n;
for(int i=1; i<=n; i++)
in>>v[i];
}
void rezolva()
{
int i;
vs[0] = vs[1] = vs[2] = 0;
for(i = 3; i <= n; i++)
vs[i] = max(vs[i-1], v[i]+v[i-1]+vs[i-3]);
s = max(s, vs[n]);
vs[1] = vs[2] = vs[3] = v[1]+v[n];
for(i = 4; i < n-1; i++)
vs[i] = max(vs[i-1], v[i]+v[i-1]+vs[i-3]);
s = max(s, vs[n-2]);
vs[2] = vs[3] = vs[4] = v[1]+v[2];
for(i = 5; i < n; i++)
vs[i] = max(vs[i-1], v[i]+v[i-1]+vs[i-3]);
s = max(s,vs[n-1]);
}
void write()
{
out<<s<<'\n';
}
int main()
{
citire();
rezolva();
write();
return 0;
}