Pagini recente » Cod sursa (job #540563) | Cod sursa (job #313202) | Cod sursa (job #591147) | Cod sursa (job #1634120) | Cod sursa (job #35236)
Cod sursa(job #35236)
#include <cstdio>
#define Nmax 100050
#define max(a,b) ((a) >= (b) ? (a) : (b))
int n, sol;
int sir[Nmax], d[Nmax];
void citire()
{
int i;
scanf("%d\n", &n);
for (i = 1; i <= n; ++i)
scanf("%d ", &sir[i]);
for (i = n + 1; i <= n + 5; ++i)
sir[i] = sir[i - n];
}
void solve()
{
int i, k;
for (k = 1; k <= 4; ++k)
{
for (i = 4; i <= n + 1; ++i)
d[i] = max(d[i - 1], d[i - 3] + sir[i - 1] + sir[i - 2]);
if (sol < d[n])
sol = d[n + 1];
for (i = 1; i <= n + 3; ++i)
sir[i] = sir[i + 1];
}
printf("%d\n", sol);
}
int main()
{
freopen("oo.in", "r", stdin);
freopen("oo.out", "w", stdout);
citire();
solve();
return 0;
}