답안 #640171

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640171	2022-09-13T19:02:27 Z	tvladm2009	Mean (info1cup19_mean)	C++14	100 / 100	2 ms	468 KB

mean

#include <bits/stdc++.h>

using ll = long long;

const int MAX_N = 200;

int a[1 + MAX_N], dp[1 + MAX_N + 1][1 + MAX_N];

int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);
  int n;
  std::cin >> n;
  for (int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    dp[i][i] = a[i];
  }
  for (int h = 2; h <= n; h++) {
    for (int i = 1; i + h - 1 <= n; i++) {
      int j = i + h - 1;
      for (int k = i; k <= j; k++) {
        dp[i][j] = std::max(dp[i][j], (dp[i][k] + dp[k + 1][j]) / 2);
      }
    }
  }
  std::cout << dp[1][n];
  return 0;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	328 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct

Subtask #2

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	328 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	2 ms	468 KB	Output is correct
18	Correct	2 ms	468 KB	Output is correct
19	Correct	2 ms	468 KB	Output is correct
20	Correct	2 ms	468 KB	Output is correct