《塞尔达传说：林克砍树》——Link/cut Tree
林克砍树。 如图： 前置知识 \(\texttt{Splay}\) \(\uparrow\) 这个算非常重要的，一定要先学会 \(\texttt{Splay}\) 。 因为 \(\texttt{LCT}\) 中的 \(\texttt{Splay}\) 与我们平时写的还不 ...
原文：[LeetCode] Cut Off Trees for Golf Event 为高尔夫赛事砍树
You are asked to cut off trees in a forest for a golf event. The forest is represented as a non negative D map, in this map: represents theobstaclecan t be reached. represents thegroundcan be walked ...
2018-01-29 21:13 1 3813 推荐指数：
相关推荐
Link-Cut Trees 小记
忘光啦 /dk /dk 本来 rotate 都会打错的我现在终于会打啦 于是 splay 打错了 基础要点 实链剖分 重链剖分是我们很熟悉的一个结构，它的优秀之处在于可以将树上问 ...
[leetcode]Unique Binary Search Trees @ Python
原题地址：https://oj.leetcode.com/problems/unique-binary-search-trees/ 题意： Given n, how many structurally unique BST's (binary ...
[LeetCode] Unique Binary Search Trees II
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should return ...
[leetcode]Unique Binary Search Trees II @ Python
原题地址：https://oj.leetcode.com/problems/unique-binary-search-trees-ii/ 题意：接上一题，这题要求返回的是所有符合条件的二叉查找树，而上一题要求的是符合条件的二叉查找树的棵数，我们上一题提过，求个数一般思路是动态规划，而枚举的话 ...
[LeetCode] Minimum Height Trees 最小高度树
rooted trees, those with minimum height are called m ...
Unique Binary Search Trees leetcode java
题目： Given n, how many structurally unique BST's (binary search trees) that store values 1...n? For example, Given n = 3, there are a total ...
Unique Binary Search Trees II leetcode java
题目： Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example, Given n = 3, your program should ...