Pagini recente » Cod sursa (job #1116697) | Cod sursa (job #2814035) | Cod sursa (job #2779105) | Cod sursa (job #1314023) | Cod sursa (job #842506)
Cod sursa(job #842506)
#include <fstream>
#include <algorithm>
#define Nmax 100002
using namespace std;
ifstream f("oo.in"); ofstream g("oo.out");
int n, Smax, i, d[Nmax], x[Nmax];
void aduna(int p, int u)
{ for(i=1; i<p; ++i) d[i]=0;
d[p]=x[p]+x[p-1];
for(i=p+1; i<=u; ++i)
d[i]=max(d[i-3]+x[i]+x[i-1],d[i-1]);
Smax=max(Smax,d[u]);
}
int main()
{ f>>n;
for(i=1; i<=n; ++i) f>>x[i];
x[n+1]=x[1];
aduna(2,n-1);
aduna(3,n);
aduna(4,n+1);
g<<Smax<<'\n';
return 0;
}