Submission #140780

#	Time	Username	Problem	Language	Result	Execution time	Memory
140780		ndhuy	K blocks (IZhO14_blocks)	C++14	100 / 100	398 ms	81408 KiB

blocks

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <stack>
#include <queue>
#include <string>
#include <string.h>
#include <math.h>
#include <iomanip>
using namespace std;

#define int64 long long
#define pii pair <int64, int64>
#define fr first
#define sc second
#define heap priority_queue
struct piii{
    int64 fr, sc, th;
    bool operator < (const piii &b){
        if (fr != b.fr) return fr < b.fr;
        if (sc != b.sc) return sc < b.sc;
        return th < b.th;
    }
};
///////////////////////////////////////////////
///////////////////////////////////////////////

int n, k;
int64 a[100005];
int64 f[105][100005];
stack <int> st;
stack <int64> mx;

int main(){
    cout << setprecision(2) << fixed;
    ios::sync_with_stdio(false), cin.tie(0);
    //freopen("input.txt", "r", stdin);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    a[0] = 1e9;
    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= k; j++)
            f[j][i] = 1e12;
    f[0][0] = 0;
    for (int j = 1; j <= k; j++){
        while (!st.empty()) st.pop(), mx.pop();
        a[j - 1] = 1e12;
        st.push(j - 1);
        mx.push(1e12);
        for (int i = j; i <= n; i++){
            while (st.size() && a[i] >= a[st.top()]){
                int tmp = st.top();
                st.pop();
                mx.pop();
                f[j - 1][st.top()] = min(f[j - 1][st.top()], f[j - 1][tmp]);
            }
            mx.push(min(mx.top(), f[j - 1][st.top()] + a[i]));
            st.push(i);
            f[j][i] = mx.top();
        }
        /*
        int64 tmp = f[j][n];
        for (int i = n - 1; i >= 1; i--){
            tmp = min(tmp, f[j][i]);
            //f[j][i] = tmp;
        }
        */
        //for (int i = 1; i <= n; i++) cout << f[j][i] << ' '; cout << endl;

    }
    cout << f[k][n];
    return 0;
}

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