Pagini recente » Cod sursa (job #770229) | Cod sursa (job #711172) | Cod sursa (job #2283407) | Cod sursa (job #1157537) | Cod sursa (job #40641)
Cod sursa(job #40641)
#include <stdio.h>
#include <iostream>
using namespace std;
int sir[100001];
int din[100001];
int maxm;
int n;
int main()
{
int i,j,l;
freopen("oo.in","r",stdin);
freopen("oo.out","w",stdout);
scanf("%d\n", &n);
for ( i = 1; i <= n; i++ )
scanf("%d ", &sir[i] );
sir[0] = sir[n];
sir[n+1] = sir[1];
for ( l = 0; l <= 3; l++ )
{
for ( i = 0 ; i <= n; i++ ) din[i] = 0;
din[l] = sir[l] + sir[l+1];
for ( i = l+3; i <= n-(3-l); i++ )
{
din[i] = sir[i] + sir[i+1];
for ( j =3; j <= 5; j++ )
if ( i-j >= l )
din[i] = max( din[i], din[i-j]+sir[i]+sir[i+1] );
if ( din[i] > maxm ) maxm = din[i];
}
}
printf("%d\n", maxm );
fclose(stdin);
fclose(stdout);
return 0;
}