w571523631的博客

题目链接：点击打开链接 题目大意：懒得说了 题目思路：看题目的的问法，我们很容易想到是最小点覆盖或者边覆盖的问题，我们可以发现对于某个重要的点（x,y）,只用x,y其中一个点备选中就行，是不是发现了，就是最小点覆盖的定义：求最小数量的点，使得包括每条边的至少一个端点，所以，我们对于每一个重要位置的左边，根据行列建图，从x联向y，容量为1，然后求最小点覆盖，但是这里还有一个地方就是会有障碍点

Problem K — limit 10 seconds Tile Cut When Frodo, Sam, Merry, and Pippin are at the Green Dragon Inn drinking ale, they like to play a little game with parchment and pen to decide who buys the next...

Description: In order to increase the happiness index of people's lives, King Y has decided to develop the manufacturing industry vigorously. There are total n kinds of products that King can choose ...