Pagini recente » Cod sursa (job #2820170) | Cod sursa (job #104768) | Cod sursa (job #1923749) | Cod sursa (job #2211748) | Cod sursa (job #672431)
Cod sursa(job #672431)
#include<fstream>
#define nmax 100005
using namespace std;
int d[nmax],a[nmax],m;
inline int max(int a,int b){ if(a>b)return a; else return b; }
void calc(int p,int u){
d[p-2]=0;
d[p-1]=a[p-1]+a[p-2];
for(int i=p;i<=u;++i){
d[i]=max(d[i-1],d[i-3]+a[i-1]+a[i]);
m=max(d[i],m);
}
}
int main(void){
ifstream fin("oo.in");
ofstream fout("oo.out");
int n,i,j;
fin>>n;
for(i=1;i<=n;++i)fin>>a[i];fin.close();
a[n+1]=a[1];
calc(3,n-1);
calc(4,n);
calc(5,n+1);
fout<<m; fout.close();
return 0;
}