제출 #443102

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443102		leaked	K blocks (IZhO14_blocks)	C++14	53 / 100	1089 ms	85380 KiB

blocks

#include <bits/stdc++.h>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("-O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define vec vector
#define sz(x) ( int)x.size()
#define m_p make_pair
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;
typedef long long ll;
typedef pair<ll, int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
typedef unsigned long long ull;
auto rng=bind(uniform_int_distribution<int>(1,1000),mt19937(time(0)));
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
const int N=1e5+1;
const int K=100;
const int lg=(int)log2(N)+1;
int lft[N],rgt[N];
int dp[N][K],a[N];
int st[N][K];
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,k;
//    n=10;k=5;
    cin>>n>>k;
    for(int i=0;i<n;i++) cin>>a[i];
    {
    vec<pii>vc;
    vc.pb({2e9,-1});
    for(int i=0;i<n;i++){
        while(sz(vc) && vc.back().f<=a[i]) vc.pop_back();
        lft[i]=vc.back().s;
        vc.pb({a[i],i});
    }
    }
    {
    vec<pii>vc;
    vc.pb({2e9,n});
    for(int i=n-1;i>=0;i--){
        while(sz(vc) && vc.back().f<=a[i]) vc.pop_back();
        rgt[i]=vc.back().s;
        vc.pb({a[i],i});
    }
    }
    for(int i=0;i<=n;i++){
        for(int j=0;j<=k;j++){
            dp[i][j]=st[i][j]=1e9;
        }
    }
    dp[0][0]=0;
    for(int j=1;j<=k;j++){
        vec<vec<int>>add(n+2,vec<int>());
        map<int,int>mp;mp[2e9]=1;
        vec<array<int,2>>arr;
        arr.pb({(int)2e9,-1});
        for(int i=j-1;i<n;i++){
            int mn=dp[i][j-1];
            while(sz(arr) && arr.back()[0]<=a[i]){
                umin(mn,arr.back()[1]);
                arr.pop_back();
            }
            arr.pb({a[i],mn});
            mn+=a[i];
//            cerr<<i+1<<' '<<rgt[i]+1<<endl;
            add[i+1].pb(mn);
            add[rgt[i]+1].pb(-mn);
        }
        for(int i=j;i<=n;i++){
            for(auto &z : add[i]){
                if(z>=0) mp[z]++;
                else mp[-z]--;
                z=abs(z);
                if(!mp[z]) mp.erase(z);
            }
            dp[i][j]=mp.begin()->f;
        }
    }
    cout<<dp[n][k];
    return 0;
}

/*
2 1
299 854
*/

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