Pagini recente » Cod sursa (job #2161448) | Cod sursa (job #653812) | Cod sursa (job #99151) | Cod sursa (job #2304871) | Cod sursa (job #771833)
Cod sursa(job #771833)
#include <fstream>
using namespace std;
int N;
int v[100010];
int dp[100010][3];
void Citire () {
ifstream fin ("oo.in");
fin >> N;
for (int i = 1; i <= N; i++)
fin >> v[i];
fin.close ();
}
int Business () {
dp[1][1] = v[1] + v[N];
dp[2][1] = dp[1][1];
dp[2][2] = v[1] + v[2];
for (int i = 3; i < N - 1; i++)
{
dp[i][0] = max (v[i] + v[i - 1] + dp[i - 3][0], dp[i - 1][0]);
dp[i][1] = max (v[i] + v[i - 1] + dp[i - 3][1], dp[i - 1][1]);
dp[i][2] = max (v[i] + v[i - 1] + dp[i - 3][2], dp[i - 1][2]);
}
dp[N - 1][0] = max (v[N - 1] + v[N - 2] + dp[N - 4][0], dp[N - 2][0]);
dp[N - 1][1] = dp[N - 2][1];
dp[N - 1][2] = max (v[N - 1] + v[N - 2] + dp[N - 4][0], dp[N - 2][0]);
dp[N][0] = max (v[N] + v[N - 1] + dp[N - 3][0], dp[N - 1][0]);
dp[N][1] = dp[N - 1][1];
dp[N][2] = dp[N - 1][2];
return max (dp[N][0], max (dp[N][1], dp[N][2]));
}
void Scriere () {
ofstream fout ("oo.out");
fout << Business ();
fout.close ();
}
int main () {
Citire ();
Scriere ();
return 0;
}