Pagini recente » Cod sursa (job #1088080) | Cod sursa (job #2789643) | Cod sursa (job #856888) | Cod sursa (job #1738348) | Cod sursa (job #1483357)
#include<cstdio>
#include<algorithm>
using namespace std;
int n,a[100001],i,b[100000],c[100001],d[99999];
int main() {
freopen("oo.in","r",stdin),freopen("oo.out","w",stdout),scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",a+i);
b[2]=a[1]+a[2],c[3]=a[2]+a[3],d[1]=a[n]+a[1],b[3]=b[2],c[4]=c[3],d[2]=d[1];
for(i=4;i<n;i++)
b[i]=max(b[i-1],b[i-3]+a[i]+a[i-1]);
for(i=5;i<=n;i++)
c[i]=max(c[i-1],c[i-3]+a[i]+a[i-1]);
for(i=3;i<n-1;i++)
d[i]=max(d[i-1],d[i-3]+a[i]+a[i-1]);
printf("%d",max(b[n-1],max(c[n],d[n-2])));
}