Pagini recente » Cod sursa (job #732395) | Cod sursa (job #1856783) | Cod sursa (job #460701) | Cod sursa (job #1462295) | Cod sursa (job #1857560)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
const int NMAX = 100000 + 5;
int n;
int v[NMAX], dp[NMAX];
void Read()
{
fin >> n;
for (int i = 1; i <= n; ++i)
fin >> v[i];
}
int main()
{
Read();
dp[n] = v[n] + v[1];
for (int i = n - 1; i >= 1; --i)
{
dp[i] = v[i] + v[i + 1] + dp[i + 3];
if (dp[i + 3] > dp[i])
dp[i] = dp[i + 3];
}
dp[1] = v[1] + v[n] + dp[4];
if (dp[4] > dp[1])
dp[1] = dp[4];
// for (int i = 1; i <= n; ++i)
// cout << dp[i] << " ";
//cout << endl;
fout << dp[1];
}