标号 | 题目 | 题解 | 备注 |
---|---|---|---|
1001 | Battle Over Cities - Hard Version | C++ | 最小树生成算法(Kruskal) |
1002 | Business | C++ | 动态规划 |
1003 | Universal Travel Sites | C++ | 最大流算法(Edmonds_Karp) |
1004 | To Buy or Not to Buy - Hard Version | C++ | DFS剪枝 |
1005 | Programming Pattern | C++ | 后缀数组/Hash |
1006 | Tree Traversals - Hard Version | DFS剪枝 | |
1007 | Red-black Tree | C++ | 动态规划 |
1008 | Airline Routes | C++ | tarjan算法 |
1009 | Triple Inversions | C++ | 树状数组/平衡二叉树 |
1010 | Lehmer Code | C++ | 树状数组/平衡二叉树 |
1011 | Cut Rectangles | C++ | 暴力判断 |
1012 | Greedy Snake | DFS剪枝 | |
1013 | Image Segmentation | C++ | 最小生成树算法(Kruskal) |
1014 | Circles of Friends | C++ | BFS求最大深度 |
1015 | Letter-moving Game | C++ | 最长公共序列 |
1016 | Uniqueness of MST | C++ | 最小生成树算法(Kruskal) |
1017 | The Best Peak Shape | C++ | 动态规划 |
1018 | Subnumbers | C++ | 数学问题 |
1019 | Separate the Animals | DFS剪枝 | |
1020 | Delete At Most Two Characters | C++ | 数学问题 |
1021 | Safe Fruit | C++ | 最大独立集算法(Bron-Kerbosch) |
1022 | Werewolf | C++ | DFS剪枝 |
1023 | The Best Polygon | 动态规划 | |
1024 | Currency Exchange Centers | C++ | 最小生成树算法(Kruskal) |
1025 | Keep at Most 100 Characters | C++ | 动态规划 |
1026 | String of Colorful Beads | C++ | 双指针 |
1027 | Larry and Inversions | C++ | 数学问题 |
PAT顶级目录(C++)
最新推荐文章于 2021-09-11 17:09:30 发布