2018年8月25日

TZOJ 3665 方格取数(2)(最大点权独立集)

摘要: 描述 给你一个m*n的格子的棋盘,每个格子里面有一个非负数。 从中取出若干个数,使得任意的两个数所在的格子没有公共边,就是说所取数所在的2个格子不能相邻,并且取出的数的和最大。 给你一个m*n的格子的棋盘,每个格子里面有一个非负数。 从中取出若干个数,使得任意的两个数所在的格子没有公共边,就是说所取 阅读全文

posted @ 2018-08-25 23:05 大桃桃 阅读(198) 评论(0) 推荐(0)

TZOJ 1911 A Plug for UNIX(最大流)

摘要: 描述 You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an internationa 阅读全文

posted @ 2018-08-25 22:56 大桃桃 阅读(201) 评论(0) 推荐(0)

TZOJ 1594 Optimal Milking(二分+最大流)

摘要: 描述 FJ has moved his K (1 <= K <= 30) milking machines out into the cow pastures among the C (1 <= C <= 200) cows. A set of paths of various lengths ru 阅读全文

posted @ 2018-08-25 22:28 大桃桃 阅读(116) 评论(0) 推荐(1)

TZOJ 1705 Dining(拆点最大流)

摘要: 描述 Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulo 阅读全文

posted @ 2018-08-25 21:51 大桃桃 阅读(120) 评论(0) 推荐(0)

导航