제출 #982478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982478		Aiperiii	K개의 묶음 (IZhO14_blocks)	C++14	100 / 100	130 ms	82472 KiB

blocks

#include <bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=1e5+5;
int dp[105][N];
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    vector <int> a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    int mx=0;
    for(int i=0;i<n;i++){
        mx=max(mx,a[i]);
        dp[0][i]=mx;
    }
    for(int i=1;i<m;i++){
        stack <pair <int,int> > st;
        for(int j=i;j<n;j++){
            int x=dp[i-1][j-1];
           
            while(!st.empty()){
                if(st.top().ss<=a[j]){
                    x=min(x,st.top().ff);
                    st.pop();
                }
                else break;
            }
            dp[i][j]=x+a[j];
            if(!st.empty())dp[i][j]=min(dp[i][j],st.top().ff+st.top().ss);
            if(st.empty() or st.top().ff+st.top().ss>x+a[j])st.push({x,a[j]});
        }
    }
    cout<<dp[m-1][n-1]<<"\n";
}
/*
 
 
*/
 

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