제출 #1035994

#제출 시각아이디문제언어결과실행 시간메모리
1035994ByeWorldK개의 묶음 (IZhO14_blocks)C++14
100 / 100
223 ms89712 KiB
#include <bits/stdc++.h> // #pragma GCC optimize("O3", "unroll-loops") #define ll long long #define int long long #define pb push_back #define fi first #define se second #define lf (id<<1) #define rg ((id<<1)|1) #define md ((l+r)>>1) #define ld long double using namespace std; typedef pair<int,int> pii; typedef pair<pii, int> ipii; const int MAXN = 2e5+10; const int MAXK = 110; const int INF = 1e9+10; const int LOG = 19; const int MOD = 998244353; const int SQRT = 450; void chmn(int &a, int b){ a = min(a, b); } int n, k, a[MAXN]; int dp[MAXN][MAXK]; signed main(){ cin >> n >> k; for(int i=1; i<=n; i++){ cin >> a[i]; } for(int i=0; i<=n; i++) for(int j=0; j<=k; j++) dp[i][j] = INF; dp[0][0] = 0; for(int j=1; j<=k; j++){ vector <int> vec, mn, pref; vec.pb(INF); mn.pb(INF); pref.pb(INF); // mn dp, pref dp for(int i=1; i<=n; i++){ int runmn = dp[i-1][j-1]; while(!vec.empty() && vec.back() <= a[i]){ chmn(runmn, mn.back()); vec.pop_back(); mn.pop_back(); pref.pop_back(); } int prba = pref.back(); vec.pb(a[i]); mn.pb(runmn); pref.pb(min(prba, vec.back() + mn.back()) ); dp[i][j] = pref.back(); } } cout << dp[n][k] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...