제출 #87307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
87307		7Polygonz	K개의 묶음 (IZhO14_blocks)	C++11	0 / 100	11 ms	4860 KiB

blocks

using namespace std ;
#include <bits/stdc++.h> /* #7th-Polygon */
typedef pair < int , int > IntInt ;

const int N = 1e5 + 7 ;
const int K = 1e2 + 7 ;
const int INF = 1e9 + 7 ;

int n , k , a[N] , dp[N][K] ;

int main()
{
    ios::sync_with_stdio(false) ;
    cout.tie(nullptr) ;
    cin.tie(nullptr) ;

    cin >> n >> k ;
    for (int i = 1 ; i <= n ; ++i)
        cin >> a[i] ;

    for (int i = 1 ; i <= n ; ++i)
    {
        dp[i][1] = max(dp[i - 1][1] , a[i]) ;
        for (int b = 2 ; b <= k ; ++b)
            dp[i][b] = INF ;
    }

    for (int b = 2 ; b <= k ; ++b)
    {
        stack < IntInt > my_stack ;
        for (int i = b ; i <= n ; ++i)
        {
            int min_dp = dp[i - 1][b - 1] ;
            for ( ; my_stack.size() ; my_stack.pop())
            {
                if (a[my_stack.top().first] > a[i]) break ;
                min_dp = min(min_dp , my_stack.top().second) ;
            }

            dp[i][b] = min_dp + a[i] ;
            if (my_stack.size()) dp[i][b] = min(dp[i][b] , dp[i][my_stack.top().first]) ;
            my_stack.emplace(i , min_dp) ;
        }
    }

    cout << dp[n][k] << "\n" ;
    return 0 ;
}

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