Pagini recente » Cod sursa (job #1321345) | Cod sursa (job #1584318) | Monitorul de evaluare | Cod sursa (job #1248230) | Cod sursa (job #1774000)
#include <iostream>
#include <fstream>
using namespace std;
int a[100000],n,nr[100000],a2[100000],a3[100000];
ifstream f("oo.in");
ofstream g("oo.out");
int main()
{
int solutie=0;
f>>n;
for(int i=1;i<=n;i++)
f>>nr[i];
for(int i=2;i<n;i++){
if(i<3)
a[i]=max(a[i-1],nr[i-1]+nr[i]);
else a[i]=max(a[i-1],nr[i-1]+nr[i]+a[i-3]);
}
solutie=a[n-1];
a2[1]=nr[1]+nr[n];
for(int i=3;i<n-1;i++)
a2[i]=max(a2[i-1],nr[i-1]+nr[i]+a2[i-3]);
solutie=max(solutie,a[n-2]);
for(int i=3;i<=n;i++)
a3[i]=max(a3[i-1],nr[i-1]+nr[i]+a3[i-3]);
solutie=max(solutie,a3[n]);
g << solutie << "\n";
return 0;
}