Submission #337232

#	Time	Username	Problem	Language	Result	Execution time	Memory
337232		boykut	K blocks (IZhO14_blocks)	C++14	53 / 100	1088 ms	4460 KiB

blocks

#include <map>
#include <vector>
#include <iostream>

using namespace std;

const int inf = 2e9;

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

int32_t 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 <= N; i++) {
      for (int j = 0; j <= K; j++) {
         dp[i][j] = inf;
      }
   }
   
   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 = a[l];
      for (int i = l; i <= r; i++) {
         mx = max(mx, a[i]);
      }
      return mx;
   };
   
   for (int k = 2; k <= K; k++) {
      for (int i = 1; i <= N; i++) {
         int mn = 2e9;
         for (int j = 1; j <= i - 1; j++) {
            mn = min(mn, dp[j][k - 1] + getmax(j + 1, i));
         }
         dp[i][k] = mn;
      }
   }
   
   cout << dp[N][K] << '\n';
   
   return 0;
}

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