Pagini recente » Cod sursa (job #2143245) | Cod sursa (job #2204370) | Cod sursa (job #1460942) | Cod sursa (job #395568) | Cod sursa (job #3230680)
#include <bits/stdc++.h>
#define int long long
const int NMAX = 1e5;
using namespace std;
ifstream fin ("oo.in");
ofstream fout ("oo.out");
int v[NMAX + 5], n;
int solve(int start, int endd){
int dp[NMAX + 5] = {0};
dp[start + 1] = v[start] + v[start + 1];
for (int i = start + 2; i <= endd; ++i)
dp[i] = max(dp[i - 1], dp[i - 3] + v[i - 1] + v[i]);
return dp[endd];
}
signed main(){
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
fout << max({solve(1, n - 1), solve(2, n), solve(3, n + 1)});
return 0;
}