type_q的专栏

之前见到这道题时没像出来怎么写，今天在网上搜了一下，发现了一个名词-状态压缩的动态规划。在这个题里的状态压缩的表现形式就是用二进制表示已选集合，这样做就可以用动态规划来解这种解空间为排序树的题了，之前见过几道这种题，都卡在如何表示已选集合上面。收获不小。#includeint dp[1 << 16], end[1 << 16], back[1 << 16];int d[16], c[16];

感觉自己搞懂这个算法了，记录一下。

Problem C. MillionaireThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Gui

ProblemYou are given an N x N matrix with 0 and 1 values. You can swap any two adjacent rows of the matrix.Your goal is to have all the 1 values in the matrix below or on the main diagonal. That i

ProblemIn a kingdom there are prison cells (numbered 1 to P) built to form a straight line segment. Cells number i and i+1 are adjacent, and prisoners in adjacent cells are called "neighbours." A