Pagini recente » Cod sursa (job #2031010) | Cod sursa (job #1161476) | Cod sursa (job #2979437) | Cod sursa (job #2403178) | Cod sursa (job #2286296)
#include <fstream>
#define N 100000
using namespace std;
int a[N+5],dp[N+5];
int n,maxi;
void initializare()
{
for(int i=1;i<=n+1;i++)
dp[i]=0;
}
void sector12()//incep cu sectoarele 1 si 2
{
dp[2]=a[1]+a[2];
for(int i=3;i<n;i++)
dp[i]=max(dp[i-1],dp[i-3]+a[i-1]+a[i]);
maxi=max(maxi,dp[n-1]);
initializare();
}
void sector23()//incep cu sectoarele 2 si 3
{
dp[3]=a[2]+a[3];
for(int i=4;i<=n;i++)
dp[i]=max(dp[i-1],dp[i-3]+a[i-1]+a[i]);
maxi=max(maxi,dp[n]);
initializare();
}
void sector34()//incep cu sectoarele 3 si 4
{
a[n+1]=a[n];
dp[4]=a[3]+a[4];
for(int i=5;i<=n+1;i++)
dp[i]=max(dp[i-1],dp[i-3]+a[i-1]+a[i]);
maxi=max(maxi,dp[n+1]);
}
int main()
{
ifstream f("oo.in");
ofstream g("oo.out");
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
sector12();
sector23();
sector34();
g<<maxi;
return 0;
}