제출 #1171159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171159		CrabCNH	K개의 묶음 (IZhO14_blocks)	C++20	0 / 100	0 ms	328 KiB

blocks

#include <bits/stdc++.h>

#define task   "BriantheCrab"

#define int    long long
#define pii    pair <int, int>
#define fi     first
#define se     second
#define szf    sizeof
#define sz(s)  (int)((s).size())

using namespace std;

template <class T> void mini (T &t, T f) {if (t > f) t = f;}
template <class T> void maxi (T &t, T f) {if (t < f) t = f;}

const int maxN = 1e5 + 5;
const int maxK = 1e2 + 5;
const int inf = 1e18 + 7;
const int mod = 1e9 + 7;

int n, K;
int a[maxN];
int dp[maxN][maxK]; // minium splited with k values in current i
// dp i k = max (dp j k - 1 + max (ai -> aj))

struct ST {
    int st[maxN * 4];
    
    void upd (int id, int l, int r, int pos, int val) {
        if (pos < l || pos > r) {
            return;
        }
        if (l == r) {
            st[id] = val;
            return;
        }
        int mid = (l + r) >> 1;
        upd (id * 2, l, mid, pos, val);
        upd (id * 2 + 1, mid + 1, r, pos, val);
        st[id] = max (st[id * 2], st[id * 2 + 1]);
    }
    
    int get (int id, int l, int r, int u, int v) {
        if (v < l || u > r) {
            return 0;
        }
        if (u <= l && r <= v) {
            return st[id];
        }
        int mid = (l + r) >> 1;
        int tL = get (id * 2, l, mid, u, v);
        int tR = get (id * 2 + 1, mid + 1, r, u, v);
        return max (tL, tR);
    }
} T;

void solve () {
    cin >> n >> K;
    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
        T.upd (1, 1, n, i, a[i]);
    }
    for (int i = 0; i <= n; i ++) {
        for (int k = 1; k <= K; k ++) {
            dp[i][k] = inf;
        }
    }
    for (int i = 1; i <= n; i ++) {
        dp[i][1] = T.get (1, 1, n, 1, i);
    }
    for (int k = 2; k <= K; k ++) {
        for (int i = 1; i <= n; i ++) {
            for (int j = 1; j <= i; j ++) {
                //cout << dp[j][k - 1] << ' ' << T.get (1, 1, n, j, i) << ' ' << i << ' ' << j << ' ' << k << '\n';
                mini (dp[i][k], dp[j][k - 1] + T.get (1, 1, n, j, i));
            }
            //cout << i << ' ' << k << ' ' << dp[i][k] << '\n';
        }
    }
    cout << dp[n][K];
}

signed main () {
    cin.tie (nullptr) -> sync_with_stdio (false);
    if (fopen (task".inp", "r")) {
        freopen (task".inp", "r", stdin);
        freopen (task".out", "w", stdout);
    }
    int t = 1;
    //cin >> t;
    while (t --) {
        solve ();
    } 
    return 0;
}
// thfdgb

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp: In function 'int main()':
blocks.cpp:87:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |         freopen (task".inp", "r", stdin);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
blocks.cpp:88:17: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         freopen (task".out", "w", stdout);
      |         ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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