Pagini recente » Cod sursa (job #541871) | Cod sursa (job #227855) | Cod sursa (job #3220468) | Cod sursa (job #2199550) | Cod sursa (job #2664043)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("oo.in");
ofstream out("oo.out");
int n, ans = -1;
int v[100100], dp[100100];
void printDp()
{
for(int i = 1; i <= n; i++)
cout << dp[i] << ' ';
cout << "\n\n";
}
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i];
dp[1] = v[1];
dp[2] = v[2] + v[1];
dp[3] = dp[2];
int i;
for(i = 4; i < n; i++)
dp[i] = max(dp[i - 1], dp[max(0, i - 3)] + v[i - 1] + v[i]);
//printDp();
ans = max(ans, dp[i - 1]);
dp[1] = v[1];
dp[2] = dp[1];
for(i = 3; i < n - 1; i++)
dp[i] = max(dp[i - 1], dp[max(0, i - 3)] + v[i - 1] + v[i]);
//printDp();
ans = max(ans, dp[i - 1] + v[n]);
dp[1] = 0;
//cout << i << '\n';
for(i = 3; i < n - 2; i++)
dp[i] = max(dp[i - 1], dp[max(0, i - 3)] + v[i - 1] + v[i]);
//cout << i << '\n';
//printDp();
ans = max(ans, dp[i - 1] + v[n - 1] + v[n]);
out << ans << '\n';
return 0;
}