Submission #369480

#	Time	Username	Problem	Language	Result	Execution time	Memory
369480		MilosMilutinovic	K개의 묶음 (IZhO14_blocks)	C++14	0 / 100	1 ms	492 KiB

blocks

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  const int inf = (int) 1e9;
  vector<vector<int>> dp(n, vector<int>(k, inf));
  int curr = 0;
  for (int i = 0; i < n; i++) {
    curr = max(curr, a[i]);
    dp[i][0] = curr;
  }
  for (int i = 1; i < k; i++) {
    for (int j = 0; j < n; j++) {
      int mx = 0;
      for (int l = j; l >= 0; l--) {
        mx = max(mx, a[l]);
        dp[j][i] = min(dp[j][i], dp[l][i - 1] + mx);
      }
    }
  }
  cout << dp[n - 1][k - 1] << '\n';
  return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 18
• Subtask 3: 0 / 21
• Subtask 4: 0 / 47