摘要：
Five hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dr 阅读全文
|
摘要：
Five hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dr 阅读全文
摘要：
Farmer John and Betsy are playing a game with N (1 <= N <= 30,000)identical cubes labeled 1 through N. They start with N stacks, each containing a sin 阅读全文
摘要：
主要函数： 路径压缩之递归优化：（使用递归优化可以遍历到每一个节点，在进行回溯的时候我们可以对子节点与父节点的关系进行处理，在解决带权并查集时常用到） 但是当数据量过大时，就不能用了，会MLE错误 路径压缩非递归 阅读全文
|