Submission #1101529

#	Time	Username	Problem	Language	Result	Execution time	Memory
1101529		MThanCCVA	K blocks (IZhO14_blocks)	C++14	100 / 100	144 ms	42296 KiB

blocks

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int MAXN = 1e5 + 5;
int n, k;
int dp[MAXN][105], a[MAXN];
 
int main() { 
  // freopen("blocks.inp", "r", stdin);
  // freopen("blocks.out", "w", stdout);
	cin >> n >> k;
	memset(dp, 0x3f, sizeof(dp));
	int mx = 0;
	for (int i = 1; i <= n; i++) {
	  cin >> a[i];
	  mx = max(mx, a[i]);
	  dp[i][1] = mx;
	}
	for (int j = 2; j <= k; j++) {
		stack<pii> s;
	 	for (int i = 1; i <= n; i++) {
	 		int tmp = dp[i - 1][j - 1];
	 		while (!s.empty() && s.top().first < a[i]) {
	 			tmp = min(tmp, s.top().second);
	 			s.pop();
	 		}
	 		if (s.empty() || a[i] + tmp < s.top().first + s.top().second) 
	 			s.push({a[i], tmp});
 
	 		if (i >= j) dp[i][j] = s.top().first + s.top().second;
	 	}
	}
	cout << dp[n][k];
  return 0;
}  

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