# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
364960 | Matteo_Verz | Mean (info1cup19_mean) | C++11 | 3 ms | 492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
`-/oo+/- ``
.oyhhhhhhyo.`od
+hhhhyyoooos. h/
+hhyso++oosy- /s
.yoooossyyo:``-y`
..----.` ``.-/+:.`
`````..-::/.
`..```.-::///`
`-.....--::::/:
`.......--::////:
`...`....---:::://:
`......``..--:::::///:`
`---.......--:::::////+/`
----------::::::/::///++:
----:---:::::///////////:`
.----::::::////////////:-`
`----::::::::::/::::::::-
`.-----:::::::::::::::-
...----:::::::::/:-`
`.---::/+osss+:`
``.:://///-.
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cmath>
using namespace std;
const int INF = 2e9;
const int N = 200;
int dp[5 + N][5 + N];
int v[5 + N];
int main() {
#ifdef CP
freopen("mean.in", "r", stdin);
freopen("mean.out", "w", stdout);
#endif // CP
int n, Max(0);
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%d", &v[i]);
dp[i][i] = v[i];
}
for(int i = 1; i < n; i++) {
for(int j = 1; j < n - i + 1; j++) {
Max = 0;
for(int k = j; k < i + j; k++) {
Max = max(Max, (dp[j][k] + dp[k + 1][i + j]) / 2);
}
dp[j][i + j] = Max;
}
}
printf("%d\n", dp[1][n]);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |