Cod sursa(job #3230678)
Utilizator | Mohanu Dominic deer | Data | 22 mai 2024 11:23:17 |
---|---|---|---|
Problema | Oo | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <bits/stdc++.h>
const int NMAX = 1e5;
using namespace std;
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(){
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> v[i];
cout << max({solve(1, n - 1), solve(2, n), solve(3, n + 1)});
return 0;
}