Submission #1162804

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162804		lopkus	K blocks (IZhO14_blocks)	C++20	0 / 100	0 ms	328 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 + 1);
  for(int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<vector<int64_t>> dp(n + 1, vector<int64_t>(k + 1));
  for(int i = 0; i <= n; i++) {
    for(int j = 0; j <= k; j++) {
      dp[i][j] = 1e12;
    }
  }
  for(int i = 0; i <= n; i++) {
    dp[i][0] = 0;
  }
  /**
  vector<vector<int64_t>> dp(n + 1, vector<int64_t>(k + 1));
  for(int i = 0; i <= n; i++) {
    for(int j = 0; j <= k; j++) {
      dp[i][j] = 1e12;
    }
  }
  dp[0][0] = 0;
  for(int i = 1; i <= n; i++) {
    for(int j = 1; j <= min(k, i); j++) {
      int mx = a[i];
      for(int x = i - 1; x >= 0; x--) {
        dp[i][j] = min(dp[i][j], dp[x][j - 1] + mx);
        mx = max(mx, a[x]);
      }
    }
  }
  **/
  for(int c = 0; c < k; c++) {
    for(int i = 1; i <= n; i++) {
      for(int l = c + 1; l <= n; l++) {
        int mx = 0;
        for(int r = l; r <= n; r++) {
          mx = max(mx, a[r]);
          if(l <= i && i <= r && mx == a[i]) {
            dp[r][c + 1] = min(dp[r][c + 1], dp[l - 1][c] + a[i]);
          }
        }
      }
    }
  }
  cout << dp[n][k];
}

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