| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1075517 | raduv | Mean (info1cup19_mean) | C++17 | 2 ms | 604 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.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
int dp[MAXN + 1][MAXN + 1]; // dp[i][j] = maximul dupa aplicarea operatiilor pentru subsecv (i, j)
int v[MAXN + 1];
int main() {
  int n, i, j, k;
  scanf("%d", &n);
  for( i = 1; i <= n; i++ ){
    scanf("%d", &v[i]);
    dp[i][i] = v[i];
  }
  for( i = 1; i <= n; i++ ){
    for( j = i + 1; j <= n; j++ ){
      for( k = j - i; k <= j; k++ ){
        dp[j - i][j] = max(dp[j - i][j], (dp[j - i][k] + dp[k + 1][j]) / 2);
      }
    }
  }
  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... | ||||
