oj.uz

Submission #521349

# Submission time Handle Problem Language Result Execution time Memory
521349 2022-02-01T20:58:45 Z raid Mean (info1cup19_mean) C++17
100 / 100
 3 ms 460 KB 
#include <iostream>

using namespace std;

const int MAXN = 205;

int dp[MAXN][MAXN];
int v[MAXN];

int main() {
  int n;

  cin >> n;
  for ( int i = 1; i <= n; ++i ) {
	cin >> v[i];
  }
  for ( int i = 1; i <= n; ++i ) {
	dp[i][i+1] = (v[i] + v[i+1]) / 2;
	dp[i][i] = v[i];
  }
  for ( int l = 3; l <= n; ++l ) {
    for ( int i = 1; i <= n - l + 1; ++i ) {
      int j = i + l - 1;
	  for ( int x = i; x < j; ++x ) {
		dp[i][j] = max( dp[i][j], (dp[i][x] + dp[x + 1][j]) / 2 );
	  }
	}
  }
  cout << dp[1][n];
  return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 292 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 0 ms 292 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 3 ms 456 KB Output is correct
20 Correct 3 ms 460 KB Output is correct