Pagini recente » Cod sursa (job #185872) | Cod sursa (job #363989) | Cod sursa (job #968525) | Cod sursa (job #1345079) | Cod sursa (job #2454579)
//
// main.cpp
// o_o
//
// Created by Andu Andu on 09/09/2019.
// Copyright © 2019 Andu Andu. All rights reserved.
//
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("oo.in");
ofstream g ("oo.out");
int n, v[100001], a, i, sum[100001][4];
int main() {
f>>n;
for(i=1;i<=n;i++) {
f>>v[i];
}
sum[2][1] = v[1]+v[2];
sum[3][2] = v[3]+v[2];
sum[4][3] = v[3]+v[4];
for(i=3;i<=n-1;++i)
{
sum[i][1]=max(sum[i-1][1], sum[i-3][1]+v[i]+v[i-1]);
}
for(int i=4;i<=n;++i)
{
sum[i][2]=max(sum[i-1][2], sum[i-3][2]+v[i]+v[i-1]);
}
for(int i=5;i<=n+1;++i)
{
sum[i][3]=max(sum[i-1][3], sum[i-3][3]+v[i]+v[i-1]);
}
g<<max(sum[n-1][1], max(sum[n][2], sum[n+1][3]));
return 0;
}