Pagini recente » Cod sursa (job #2226942) | Cod sursa (job #2745569) | Cod sursa (job #2236328) | Cod sursa (job #2460929) | Cod sursa (job #1703377)
#include <fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int n,a[100005],i,s[100005],mx;
int main()
{fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
s[1]=a[1];
s[2]=a[1]+a[2];
for(i=3;i<n;i++)
{s[i]=max(s[i-3]+a[i]+a[i-1],s[i-1]);
}
mx=s[n-1];
s[n]=a[n];
s[n-1]=a[n]+a[n-1];
for(i=n-2;i>1;i--)
{s[i]=max(s[i+3]+a[i]+a[i+1],s[i+1]);
}
if(mx<s[2])mx=s[2];
fout<<mx;
}