제출 #367631

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

blocks

#include <bits/stdc++.h>
#pragma GCC optimize("O2") 
using namespace std;
 
#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
 
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;
 

struct SparseTable {
    int n, k;
    vector<int> a;
    vector<vector<int>> st;

    void init(vector<int> a) {
        this->a = a;
        n = (int) a.size();
        k = lg(n);
        st.assign(n + 1, vector<int>(k + 1));
        build();
    }

    int lg(int x) { return 31 - __builtin_clz(x); }

    int merge(int x, int y) {
        if(a[x] < a[y]) return x;
        return y;
    }

    void build() {
        for (int i = 0; i < n; i++) st[i][0] = i;

        for (int j = 1; j <= k; j++)
            for (int i = 0; i + (1 << j) - 1 < n; i++)
                st[i][j] = merge(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
    }

    int query(int l, int r) {
        int j = lg(r - l + 1);
        int idx = merge(st[l][j], st[r - (1 << j) + 1][j]);
        return a[idx];
    }
};


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int n, k;
    cin>>n>>k;
    int a[n+3];
    for(int i= 1;i<=n;i++){
        cin>>a[i];
    }
    int dp[n+3][k+3];
    for(int i= 0;i<=n;i++){
        for(int j= 0;j<=k;j++){
            dp[i][j] = INF;
        }
    }
    dp[0][1] = 0;
    for(int i = 1;i<=n;i++) {
        dp[i][1] = max(dp[i-1][1], a[i]);
    }
    vector<int> nice;
    for(int i= 0;i<n;i++){
        nice.pb(a[i+1]);
    }
    int prev[n+2];
    clr(prev, 0);
    stack<pair<int, int>> s;
    s.push({a[1], 1});
    for(int i= 2;i<=n;i++){
        while(s.empty() == false && s.top().fr < a[i]) s.pop();
        if(!s.empty()){
            prev[i] = s.top().sc;
        }
        s.push({a[i], i});
    }
    SparseTable st;
    for(int j= 2;j<=k;j++){
        vector<int> arr;
        for(int i =1;i<=n;i++){
            arr.pb(dp[i][j-1]);
        }
        st.init(arr);
        st.build();
        for(int i= 1;i<=n;i++){
            dp[i][j] = INF;
            if(i < j) continue;
            int x = prev[i];
            int lo = max(x, 1LL);
            int hi = i-1;
            if(lo <= hi){
                dp[i][j] = min(st.query(lo-1, hi-1)+a[i], dp[i][j]);
            }
            dp[i][j] = min(dp[max(x, 0LL)][j], dp[i][j]);
        }

    }
    cout<<dp[n][k]<<endl;
    return 0;
}
 

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