Submission #1171161

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

blocks

#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
int n,k;
int a[1000005];
int rmq[1000005][20];
long long dp[101][1000005];
int 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;
    pair<long long,long long> best = {1e17,l};
    for(int i = optl;i < min(mid,optr + 1);i++){
        int v = get(i + 1,mid);
        best = min(best,{v + dp[lim - 1][i],i});
    }
    dp[lim][mid] = best.first;
    int opt = best.second;
    dnc(lim,l,mid - 1,optl,opt);
    dnc(lim,mid + 1,r,opt,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[0][i] = 0;
    }
    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 = 1;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