제출 #335062

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
335062		VROOM_VARUN	K개의 묶음 (IZhO14_blocks)	C++14	53 / 100	1068 ms	620 KiB

blocks

/*
ID: varunra2
LANG: C++
TASK: kblocks
*/

#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int n, k;

VI dp_cur, dp_before;
VI vals;

int curk = 0;

void init() {
  dp_cur.assign(n + 1, 0);
  dp_before.assign(n + 1, INF);
  dp_before[0] = 0;
  vals.resize(n);
}

// can we do dnc opt :eyes:

void calc() {
  VI opt;
  for (int i = 1; i <= n; i++) {
    if (i < curk) {
      dp_cur[i] = INF;
      continue;
    }
    PII mn = MP(INF, -1);
    int cmx = 0;
    for (int j = i; j >= curk; j--) {
      cmx = max(cmx, vals[j - 1]);
      mn = min(mn, MP(cmx + dp_before[j - 1], j));
    }
    opt.PB(mn.y);
    dp_cur[i] = mn.x;
  }
  auto cop = opt;
  sort(all(cop));
  // assert(cop == opt);
}

int main() {
  // #ifndef ONLINE_JUDGE
  // freopen("kblocks.in", "r", stdin);
  // freopen("kblocks.out", "w", stdout);
  // #endif
  cin.sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> k;

  init();

  for (int i = 0; i < n; i++) {
    cin >> vals[i];
  }

  while (curk < k) {
    curk++;
    calc();
    swap(dp_before, dp_cur);
  }

  cout << dp_before.back() << '\n';

  return 0;
}

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