제출 #1129802

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1129802		assanali	K개의 묶음 (IZhO14_blocks)	C++17	100 / 100	174 ms	3372 KiB

blocks

#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
using pld = pair <long double, long double>;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 1e9 + 7;
const ll N = 1e5 + 10;
const ll M = 1e2 + 10;
const ll P = 311;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 1e18;
ll n,a[N],k,ans,dp[N], tmp[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll _=1; //cin>>_;
while(_--) {
    cin>>n>>k;
    for(ll i = 1; i<=n; i++) {
        cin>>a[i];
        dp[i] = INT_MAX;
    }
    ll mx = 0;
    for(ll i = 1; i<=n; i++) {
        mx = max(mx, a[i]);
        dp[i] = mx;
    }
    for(ll c = 2; c<=k; c++) {
        stack <pll> st;
        for(ll i = c; i<=n; i++) {
            ll cur = dp[i-1]; // lets try to go left as far as we can to minimize out answer
            while(!st.empty()) {
                if((st.top()).F <= a[i]) {
                    cur = min(cur, (st.top()).S - (st.top()).F);
                    st.pop();
                }
                else {
                    break;
                }
            }
            if(st.empty()) {
                st.push({a[i], cur + a[i]});
            }
            else {
                st.push({a[i], min(cur + a[i], (st.top()).S)});
            }
            tmp[i] = (st.top()).S;
        }
        for(ll i = c; i<=n; i++) {
            dp[i] = tmp[i];
        }
    }
    cout<<dp[n];
}
return 0;
}
// equal, min, max, 1, random, build
/*
6
3 6 4 5 1 2
*/

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