제출 #1170950

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170950		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]);
}
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 i = 1;i <= n;i++){
        dp[0][i] = 0;
    }
    for(int j = 1;j <= k;j++){
        //cout << j << " : \n";
        for(int i = j;i <= n;i++){
               dp[j][i] = dp[j - 1][i - 1] + a[i];
            for(int ii = i - 2;ii >= j - 1;ii--){
                dp[j][i] = min(dp[j][i],dp[j - 1][ii] + get(ii + 1,i));
            }
        }
        /*for(int i = 1;i <= n;i++) cout << dp[1 - curr][i] << " ";
        cout << "\n";
        for(int i = 1;i <= n;i++) cout << dp[curr][i] << " ";
        cout << "\n";*/
    }
    cout << dp[k][n];
    return 0;
}

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