oj.uz

답안 #443086

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443086 2021-07-09T15:55:19 Z leaked K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 1 ms 332 KB 
#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];
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,k;
    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++) dp[i][0]=2e9;
    dp[0][0]=0;
    for(int j=1;j<=k;j++){
        for(int i=0;i<=n;i++) dp[i][j]=2e9;
        for(int i=n-1;i>=0;i--) umin(dp[i][j-1],dp[i+1][j-1]);
        for(int i=j-1;i<n;i++){
            int k=max(j-1,lft[i]);
            umin(dp[rgt[i]][j],dp[k][j-1]+a[i]);
        }
    }
    cout<<dp[n][k];
    return 0;
}

/*
3 1
3 3 2
*/

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -