Submission #337230

#	Time	Username	Problem	Language	Result	Execution time	Memory
337230		boykut	K개의 묶음 (IZhO14_blocks)	C++14	0 / 100	44 ms	39916 KiB

blocks

#include <bits/stdc++.h>

using namespace std;

int dp[100001][101], a[100001];

signed main() {
   ios::sync_with_stdio(0);
   cin.tie(0);
   
   int n, k;
   cin >> n >> k;
   
   for (int i = 1; i <= n; i++) {
      cin >> a[i];
   }
  
   for (int i = 0; i <= 100000; i++) {
      for (int j = 0; j <= 100; j++) {
        dp[i][j] = INT_MAX;
      }
   }
   
   dp[0][0] = 0;
   dp[1][1] = a[1];
   for (int i = 2; i <= n; i++) {
      dp[i][1] = max(dp[i - 1][1], a[i]);
   }
   
   auto getmax = [&](int l, int r) -> int{
      int mx = INT_MIN;
      for (int i = l; i <= r; i++) 
         mx = max(mx, a[i]);
      return mx;
   };
   
   for (int j = 2; j <= k; j++) {
      for (int i = 1; i <= n; i++) {
         int mn = INT_MAX;
         for (int l = 1; l < i; l++) {
            mn = min(mn, dp[l][j - 1] + getmax(l + 1, i));
         }
         dp[i][j] = mn;
      }
   }
   
   cout << dp[n][k]<< '\n';
   
   return 0;
}

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