제출 #1170246

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170246		arkanefury	K개의 묶음 (IZhO14_blocks)	C++20	53 / 100	1094 ms	37192 KiB

blocks

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define lb lower_bound
#define F first
#define S second
#define sz size()
#define int long long
#define all(v) v.begin(),v.end()
#define FOR1(x, n) for(int j = x; j <= n; j ++)
#define FOR(x, n, m, d) for(int x = n; x <= m; x += d)
#define FORR(x, n, m, d) for(int x = n; x >= m; x -= d)
#define nikita ios_base::sync_with_stdio(0), cin.tie(0);
const int N =  3e5+5;
int a[N], b[N], pref[N], dp[N][105];
int n,m,k,sum=0,x,y, ans, r, cnt, l, mod = 1e9+7;
string s, str;
void solve(){
    cin >> n >> m;
    FOR(i, 1, n, 1)cin >> a[i];
    x = 0;
    FOR(i, 1, n, 1){
        x = max(x, a[i]);
        dp[i][1] = x;
    }
    FOR(i, 1, n,1){
        FOR(j, 2, m, 1)dp[i][j] = 1e18;
    }
    FOR(i, 2, m, 1){
        FOR(j, i, n, 1){
            x = 0;
            if(a[j] <= a[j-1] && i != j){dp[j][i] = min(dp[j-1][i-1]+a[j], dp[j-1][i]);continue;}
            FORR(ok, j, i, 1){
                x = max(x, a[ok]);
                dp[j][i] = min(dp[j][i], dp[ok-1][i-1] + x);
            }
        }
    }
    cout << dp[n][m];
}
signed main(){
    nikita
    int tt = 1;
    if(!tt)cin >> tt;
    FOR(i, 1, tt, 1)solve();
}

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