Cod sursa(job #1942701)
| Utilizator | Data | 28 martie 2017 09:52:39 | |
|---|---|---|---|
| Problema | Oo | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
#include <iostream>
using namespace std;
#define nmax 100002
int v[nmax], dp[nmax];
int main()
{
int i, n;
ifstream f("oo.in");
ofstream g("oo.out");
f >> n;
for (i = 1; i <= n; ++i)
f >> v[i];
dp[n] = v[n] + v[1];
for (i = 1; i < n; ++i)
dp[i] = v[i] + v[i + 1];
dp[1] = max(dp[n], dp[n - 2]);
dp[2] = max(dp[1], dp[n - 1] + dp[2]);
dp[3] = max(dp[2], dp[n] + dp[3]);
for (i = 4; i < n - 2; ++i)
dp[i] = max(dp[i - 1], dp[i - 3] + dp[i]);
g << dp[n - 3];
return 0;
}
