github_36268455的博客

状态压缩DPDescriptionAfter wqb0039 has made the n*n cake. We insert candles in the cake. But we hate the square,We change the cake to n*m size by do some grids changes. Now we have a cake of n*m size,an

dp 0-1背包+并查集 CodeForce 742D http://codeforces.com/problemset/problem/742/D 动态规划专题训练 题目大意：选几个美丽的小姐来参加舞会，但是每位小姐都是有着体重和魅力值，要求在有总体重上限w的情况下尽可能的选出总魅力值最高的小姐来参加。 当然如果是这样就可以直接套0-1背包的模板了。然而还加上了一个限制，就是每一位小姐都会

Let us define a regular brackets sequence in the following way: 1. Empty sequence is a regular sequence. 2. If S is a regular sequence, then (S) and [S] are both regular sequences. 3. If A and B are