Pagini recente » Cod sursa (job #1110289) | Cod sursa (job #2886119) | Cod sursa (job #3200392) | Cod sursa (job #2733797) | Cod sursa (job #2297938)
#include<fstream>
using namespace std;
ifstream fin("oo.in");
ofstream fout("oo.out");
int n,x1,x2,x3,x4;
int a[100010],v[100010];
int main(){
fin>>n;
if(n==2){
fin>>x1>>x2;
fout<<x1+x2;
return 0;
}
if(n==3){
fin>>x1>>x2>>x3;
fout<<max(max(x1+x2,x2+x3),x3+x1);
return 0;
}
if(n==4){
fin>>x1>>x2>>x3>>x4;
fout<<max(max(max(x1+x2,x2+x3),x3+x4),x4+x1);
return 0;
}
for(int i=1;i<=n;i++)
fin>>v[i];
a[1]=a[2]=a[3]=v[1]+v[n];
for(int i=4;i<n-1;i++)
a[i]=max(a[i-1],v[i-1]+v[i]+a[i-3]);
int maxim=a[n-2];
a[2]=a[3]=a[4]=v[1]+v[2];
for(int i=5;i<n;i++)
a[i]=max(a[i-1],v[i-1]+v[i]+a[i-3]);
if(maxim<a[n-1])
maxim=a[n-1];
fout<<maxim;
return 0;
}