Submission #1171180

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171180		kiennguyendinh	K blocks (IZhO14_blocks)	C++20	0 / 100	0 ms	328 KiB

blocks

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
int n,k;
long long a[1000005];
long long rmq[1000005][20];
long long dp[101][1000005];
long long get(int l,int r){
    int v = __lg(r - l + 1);
    return max(rmq[l][v],rmq[r - (1 << v) + 1][v]);
}
void dnc(int lim,int l,int r,int optl,int optr){
    if(l > r) return;
    int mid = (l + r)/2;
    long long bV = LLONG_MAX,cost;
    int bP;
    for(int i = optl;i <= min(mid - 1,optr);i++){
        cost = get(i + 1,mid) + dp[lim - 1][i];
        if(cost < bV){
            bV = cost;
            bP = i;
        }
    }
    dp[lim][mid] = bV;
    dnc(lim,l,mid - 1,optl,bP);
    dnc(lim,mid + 1,r,bP,optr);
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    for(int i = 1;i <= n;i++){
        cin >> a[i];
        rmq[i][0] = a[i];
        dp[1][i] = max(dp[1][i - 1],1LL * a[i]);
    }
    for(int k = 1;(1 << k) <= n;k++){
        for(int i = 1;i + (1 << k) - 1 <= n;i++){
           rmq[i][k] = max(rmq[i][k - 1],rmq[i + (1 << (k - 1))][k - 1]);
        }
    }
    for(int j = 2;j <= k;j++){
        dnc(j,j,n,j - 1,n - 1);
    }
    cout << dp[k][n];
    return 0;
}

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