Pagini recente » Cod sursa (job #364686) | Cod sursa (job #2156803) | Cod sursa (job #189822) | Monitorul de evaluare | Cod sursa (job #3328823)
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
const int Nmax = 1e5 + 5;
int v[Nmax], dp[Nmax];
int main()
{
int n, i;
fin >> n;
for ( i = 1; i <= n; ++i )
fin >> v[i];
for ( i = 3; i <= n; ++i )
dp[i] = max(v[i] + v[i - 1] + dp[i - 3], dp[i - 1]);
int sol = dp[n];
dp[2] = v[1] + v[2];
dp[3] = 0;
for ( i = 3; i <= n - 1; ++i )
dp[i] = max(v[i] + v[i - 1] + dp[i - 3], dp[i - 1]);
sol = max(sol, dp[n - 1]);
dp[1] = v[1] + v[n];
dp[2] = 0;
for ( i = 3; i <= n - 2; ++i )
dp[i] = max(v[i] + v[i - 1] + dp[i - 3], dp[i - 1]);
sol = max(sol, dp[n - 2]);
fout << sol << '\n';
return 0;
}