Pagini recente » Cod sursa (job #1679802) | Cod sursa (job #1279567) | Cod sursa (job #1424157) | Cod sursa (job #2683052) | Cod sursa (job #3201110)
#include <fstream>
#include <iostream>
using namespace std;
const int Vmax = 100001;
int a[Vmax], dp[Vmax];
int main(){
ifstream fin("oo.in");
ofstream fout("oo.out");
int n;
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
dp[1]=0;
dp[2]=a[1]+a[2];
for(int i=3;i<=n-1;i++){
dp[i] = max(dp[i-1], a[i] + a[i-1] + dp[i-3]);
}
int solutie=dp[n-1];
dp[2]=0;
for(int i=3;i<=n-3;i++){
dp[i] = max(dp[i-1], a[i] + a[i-1] + dp[i-3]);
}
solutie=max(solutie, dp[n-3]+a[n-1]+a[n]);
dp[3]=0;
for(int i=4;i<=n-2;i++){
dp[i] = max(dp[i-1], a[i] + a[i-1] + dp[i-3]);
}
solutie=max(solutie, dp[n-2]+a[n]+a[1]);
fout<<solutie;
}