Pagini recente » Cod sursa (job #1957165) | Cod sursa (job #999880) | Cod sursa (job #976010) | Cod sursa (job #2835236) | Cod sursa (job #597525)
Cod sursa(job #597525)
#include<fstream>
using namespace std;
int n,v[100010];
int a[100010],b[100010],c[100010];
int main()
{
int i,maxim=-2000000000;
ifstream fin("oo.in");
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin.close();
if(n==2)
maxim=v[1]+v[2];
else
if(n==3)
maxim=max(v[1]+v[2],max(v[1]+v[3],v[2]+v[3]));
else
if(n==4)
maxim=max(v[1]+v[2],max(v[1]+v[4],max(v[2]+v[3],v[3]+v[4])));
else
if(n==5)
maxim=max(v[1]+v[2],max(v[1]+v[5],max(v[2]+v[3],max(v[3]+v[4],v[4]+v[5]))));
else
{
v[n+1]=v[1];
//Cazul I
a[2]=v[1]+v[2];
for(i=3;i<n;i++)
{
a[i]=max(a[i-1],a[i-3]+v[i]+v[i-1]);
maxim=max(maxim,a[i]);
}
//Cazul II
b[3]=v[2]+v[3];
for(i=4;i<=n;i++)
{
b[i]=max(b[i-1],b[i-3]+v[i]+v[i-1]);
maxim=max(maxim,b[i]);
}
//Cazul III
c[4]=v[3]+v[4];
for(i=5;i<=n+1;i++)
{
c[i]=max(c[i-1],c[i-3]+v[i]+v[i-1]);
maxim=max(maxim,c[i]);
}
}
ofstream fout("oo.out");
fout<<maxim<<"\n";
fout.close();
return 0;
}