Pagini recente » Cod sursa (job #555233) | Cod sursa (job #1660685) | Cod sursa (job #1925826) | Cod sursa (job #690220) | Cod sursa (job #2121642)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("oo.in");
ofstream cout ("oo.out");
int main () {
int n;
cin >> n;
vector < int > v (n + 1);
for (int i = 1; i <= n; ++ i) {
cin >> v[i];
}
int aux = v[1];
for (int i = 1; i < n; ++ i) {
v[i] += v[i + 1];
}
v[n] += aux;
vector < int > dp (n + 1);
dp[1] = v[1];
dp[2] = v[2];
for (int i = 3; i <= n; ++ i) {
dp[i] = max (dp[i - 2], dp[i - 3] + v[i]);
}
cout << dp[n] << '\n';
}