Cod sursa(job #1927653)
| Utilizator | Data | 15 martie 2017 12:52:59 | |
|---|---|---|---|
| Problema | Oo | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
int N, dp[NMAX], a[NMAX];
int main() {
f >> N;
for (int i = 1; i <= N; ++i) {
f >> a[i];
}
dp[1] = a[1];
dp[2] = a[1] + a[2];
for (int i = 3; i <= N; ++i) {
dp[i] = max(max(dp[i - 1], dp[i - 2]), a[i] + a[i - 1] + dp[i - 3]);
}
dp[N] -= dp[1];
// for (int i = 1; i <= N; ++i) {
// g << dp[i] << ' ';
// }
//
// g << '\n';
g << dp[N] << '\n';
return 0;
}
