【题解】LuoGu3365：改造二叉树

原题传送门
是我出过的一道题的弱化版
排序二叉树可以中序遍历变成序列
答案仍然不好求，因为要保证上升
想到每个数减去自己的下标，转换成求最长不下降

Code：

#include <bits/stdc++.h>
#define maxn 100010
using namespace std;
int a[maxn], d[maxn], val[maxn], ls[maxn], rs[maxn], n, m;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

void dfs(int u){
	if (ls[u]) dfs(ls[u]);
	a[++m] = val[u];
	if (rs[u]) dfs(rs[u]);
}

int find(int x, int r){
	int l = 1, ans = -1;
	while (l <= r){
		int mid = (l + r) >> 1;
		if (d[mid] > x) ans = mid, r = mid - 1; else l = mid + 1;
	}
	return ans;
}

int main(){
	n = read();
	for (int i = 1; i <= n; ++i) val[i] = read();
	for (int i = 2; i <= n; ++i){
		int x = read(), y = read();
		if (y) rs[x] = i; else ls[x] = i;
	}
	dfs(1);
	for (int i = 1; i <= n; ++i) a[i] -= i;
	int ans = 0;
	for (int i = 1; i <= n; ++i){
		int x = find(a[i], ans);
		if (x == -1) d[++ans] = a[i]; else d[x] = a[i];
	}
	printf("%d\n", n - ans);
	return 0;
}