Pagini recente » Cod sursa (job #2092876) | Cod sursa (job #1848583) | Cod sursa (job #2315325) | Cod sursa (job #585078) | Cod sursa (job #1770824)
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int maxi,maxim,n,i,a[102],dx[100002],dy[100002],dz[100002];
int main()
{
fin >> n;
for (i=1;i<=n;i++)
fin >> a[i];
for(i=3;i<=n-1;i++)
dx[i]=max(dx[i-1],a[i-1]+a[i]+dx[i-3]);
for(i=3;i<=n;i++)
dy[i]=max(dy[i-1],a[i-1]+a[i]+dy[i-3]);
for(i=1;i<n;i++)
dz[i]=max(dz[i-1],a[i-1]+a[i]+dz[i-3]);
maxi=max(dx[n-2],dy[n]);
maxim=max(maxi,dz[n-1]);
fout << maxim;
return 0;
}