제출 #1304735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304735		haron1337	K개의 묶음 (IZhO14_blocks)	C++20	100 / 100	173 ms	83992 KiB

blocks

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define ii pair<int , int>
#define iii pair<int , pair<int , int>>
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define fod(i,r,l) for(int i=r;i>=l;i--)
#define file "file"
 
const int N = 1e5 + 5, mod = 1e9 + 7;
int a[N] , dp[N][105]; 
 
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);  cout.tie(0);
    //freopen(file".INP" , "r" , stdin);
    //freopen(file".OUT" , "w" , stdout);
 
    int n , k;
    cin >> n >> k;
    fo(i, 1, n)
        cin >> a[i];

    fo(i, 1, n) dp[i][1] = max(dp[i - 1][1] , a[i]);
    fo(j, 2, k)
    {
        stack <ii> st;
        fo(i, j, n)
        {
            int minf = dp[i - 1][j - 1];
            while (!st.empty() && a[st.top().se] <= a[i])
            {
                minf = min(minf , st.top().fi);
                st.pop();
            }
            if (st.empty())
                dp[i][j] = minf + a[i];
            else
                dp[i][j] = min(dp[st.top().se][j] , minf + a[i]);
            st.push({minf , i});
        }
    }
    cout << dp[n][k];
}
// haronnee_

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