Pagini recente » Cod sursa (job #1149792) | Cod sursa (job #2031242) | Cod sursa (job #2718984)
#include <bits/stdc++.h>
using namespace std;
ifstream f("oo.in");
ofstream g("oo.out");
deque <int> deq;
int n,i,v[100005],din[100005],maxim;
void caz1()
{
memset(din,0,sizeof(din));
maxim=max(maxim,v[1]+v[n]);
for (i=4;i<=n-2;i++)
{
din[i]=max(din[i],din[i-3]+v[i]+v[i-1]);
maxim=max(maxim,din[i]+v[1]+v[n]);
}
}
void caz2()
{
memset(din,0,sizeof(din));
maxim=max(maxim,v[1]+v[2]);
for (i=5;i<n-1;i++)
{
din[i]=max(din[i],din[i-3]+v[i]+v[i-1]);
maxim=max(maxim,din[i]+v[1]+v[2]);
}
}
void caz3()
{
memset(din,0,sizeof(din));
maxim=max(maxim,v[2]+v[3]);
for (i=6;i<=n;i++)
{
din[i]=max(din[i],din[i-3]+v[i]+v[i-1]);
maxim=max(maxim,din[i]+v[2]+v[3]);
}
}
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>v[i];
}
caz1();
caz2();
caz3();
g<<maxim;
return 0;
}