牛客多校第九场I (单调栈优化dp/单调栈的常用套路)

思路:

设计状态:f[i][j]表示1~j的塔被拆成i块的最小代价.

状态转移:.时间复杂度O(n^3)

转移优化:

这里我们注意到max{a_k, a_{k+1}..., a_{j}},固定j,若k越小,则max值单调递增(非严格).也就是说,max{a_1, a_2, a_3..., a_j}被划分成若干段,每一段都有一个固定的取值.假设这些段为[l_1, r_1], [l_2, r_2]....[l_s, r_s],那么我们改写状态方程,,其中val_t表示第t段的max值.

当增加一个a_{j+1}时,a_{j+1}会和前面的某一段max值合并成a_{j + 1}值,而这一段的值都小于a_{j + 1}(非严格或者严格都可以).此时我们需要找到左边第一个大于a_j的值,然后求这一段最小的f(i - 1, xxx)值,但是一个一个一个求时间复杂度会爆炸,所以我们使用结构体存这一段内最小的min值,再存前缀最小的minf + val值,然后再存a值,然后用单调栈维护a值递减的结构体.

代码:

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
#define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f 
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 8010;
int n, a[N], f[N][N], top;
struct rec {
	int v, minf, premin;
} stk[N];
//f[i][j]表示a[1~j]分了i块的最小花费
//f[i][j]=(1<=k<=j)min(f[i-1][k-1]+max{a[k],a[k+1],...a[j])})
signed main() {
	qio >> n;
	for (int i = 1; i <= n; ++i) qio >> a[i];
	for (int i = 1; i <= n; ++i) f[i][0] = f[0][i] = INF;
	f[0][0] = 0;
	for (int i = 1; i <= n; ++i) {
		stk[top = 1] = {INF, INF, INF};
		for (int j = 1; j <= n; ++j) {
			int minf = f[i - 1][j - 1];
			while (stk[top].v <= a[j]) minf = min(minf, stk[top--].minf);
			stk[top + 1] = {a[j], minf, min(stk[top].premin, minf + a[j])}, ++top;
			f[i][j] = stk[top].premin;
		}
		qio << f[i][n] << "\n";
	}
}