Pagini recente » Cod sursa (job #2930868) | Cod sursa (job #2124678) | Cod sursa (job #2826337) | Cod sursa (job #2859564) | Cod sursa (job #2115989)
#include<bits/stdc++.h>
using namespace std;
int n,a[100010],DP[100010];
int DP2[100010];
int main() {
ifstream cin("oo.in");
cin>>n;
for (int i=1; i<=n; i++) cin>>a[i];
DP[2]=a[1]+a[2];
for (int i=3; i<=n-1; i++) {
DP[i]=max(DP[i-3]+a[i-1]+a[i], DP[i-1]);
// cout<<"i-"<<i<<" "<<DP[i]<<'\n';
}
DP2[3]=a[2]+a[3];
for (int i=4; i<=n; i++) {
DP2[i]=max(DP2[i-3]+a[i-1]+a[i], DP2[i-1]);
// cout<<i<<" - "<<DP2[i]<<" \n";
}
cout<<max(DP[n],DP2[n]);
return 0;
}