摘要： You are playing some computer game. One of its levels puts you in a maze consisting of n lines, each of which contains m cells. Each cell either is fr 阅读全文

摘要： 给你一个 n *m 的矩阵，求这个矩阵内部的最长上升子序列 记忆化去dp即可 在深搜的过程中去记忆化dp 阅读全文

摘要： 有 n 个数字，你可以挑选其中任意个数字代表一个背包的体积，其余的数字表示的物品的体积，所挑选的背包必选完全装满，询问最终的方案数 思路分析 ： 定义dp[i] 表示挑选 i 状态下的物品的方案数，f[i]表示 i 状态下某一个物品为背包的方案数 dp[ i | j ] += dp[ j ] * f 阅读全文

摘要： A clique is a complete graph, in which there is an edge between every pair of the vertices. Given a graph with NNN vertices and MMM edges, your task i 阅读全文

摘要： 链接：https://www.nowcoder.com/acm/contest/203/G来源：牛客网 题目描述 有n堆石子，第i堆石子有xi个。 修修和栋栋轮流取石子，每人每次需要从任意一堆石子中取走个，修修先手。无法操作的人失败。此外，如果一个人取完了一堆石子，他会立即获胜。 不巧的是，修修除了 阅读全文

摘要： You are playing CSGO. There are n Main Weapons and m Secondary Weapons in CSGO. You can only choose one Main Weapon and one Secondary Weapon. For each 阅读全文

摘要： Recently, TeaTree acquire new knoledge gcd (Greatest Common Divisor), now she want to test you. As we know, TeaTree is a tree and her root is node 1, 阅读全文

摘要： 描述 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming 阅读全文

摘要： 推荐博客 ： https://blog.csdn.net/zjznku/article/details/65937416 其实启发式合并核心思想就是将小的集合合并到大的集合上面 例题 : HDU 4358 求一颗树上以每个点为子树中权值出现 k 次的个数有多少个 阅读全文

摘要： Recently, TeaTree acquire new knoledge gcd (Greatest Common Divisor), now she want to test you. As we know, TeaTree is a tree and her root is node 1, 阅读全文