Pagini recente » Cod sursa (job #2863989) | Cod sursa (job #2024555) | Cod sursa (job #1597964) | Cod sursa (job #2053779) | Cod sursa (job #2046076)
#include <bits/stdc++.h>
#define nmax 100000 + 2
#define in "oo.in"
#define out "oo.out"
using namespace std;
int v[ nmax ], a[ nmax ], n, maxx;
int main()
{
freopen(in, "r", stdin);
freopen(out, "w", stdout);
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &v[ i ]);
v[ n + 1 ] = v[ 1 ];
for (int i = 1; i <= 3; i++){
for (int j = i + 1; j <= n - 2 + i; j++){
a[ j ] = v[ j ] + v[ j - 1 ];
for (int k = j - 3; k >= j - 5 && k > i; k--)
a[ j ] = max(a[ j ], v[ j ] + v[ j - 1 ] + a[ k ]);
maxx = max(maxx, a[ j ]);
}
}
printf("%d", maxx);
}