Problem Description There is a grid with N rows and M columns. In each cell you can choose to put a golden or silver egg in it, or just leave it empty. If you put an egg in the cell, you wi...

最小点权覆盖集的题做起来还是挺有意思的。 Problem Description onmylove has invented a game on $latex n\times m grids. There is one positive integer on each grid. Now you can take the number...

这个题的主要难点是最小割输出方案。 Description Alice and Bob play the following game. First, Alice draws some directed graph with $latex N$ vertices and $latex M$ arcs. After that Bob trie...

很适合用来练习最小点权覆盖集的一个题。 Description It is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are ...

学到了方格图上的一种建模方向。 题目描述 在一个有 m*n 个方格的棋盘中，每个方格中有一个正整数。现要从方格中取数，使任意 2 个数所在方格没有公共边，且取出的数的总和最大。试设计一个满足要求的取...