2018年8月23日

TZOJ 4085 Drainage Ditches(最大流)

摘要: 描述 Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for a 阅读全文

posted @ 2018-08-23 22:19 大桃桃 阅读(128) 评论(0) 推荐(0)

TZOJ 3711 浪漫自习(最大流)

摘要: 描述 如今的校园谈恋爱已是习以为常,这不,去上自习也要成双成对的。现在假设某班里有N对情侣从同一寝室楼出发,到达同一个教室上自习。途中,她们可能会经过长廊、静溪等一系列的景点观光游览。但情侣们不希望在途中碰到班里的其他情侣而扫了雅兴。现在给定包括寝室、教室、以及各个景点在内共有M个场景,以及这些场景 阅读全文

posted @ 2018-08-23 22:11 大桃桃 阅读(244) 评论(0) 推荐(0)

TZOJ 1321 Girls and Boys(匈牙利最大独立集)

摘要: 描述 the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is 阅读全文

posted @ 2018-08-23 21:53 大桃桃 阅读(179) 评论(0) 推荐(0)

TZOJ 2999 Network(连通图割点数量)

摘要: 描述 A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. 阅读全文

posted @ 2018-08-23 20:40 大桃桃 阅读(159) 评论(0) 推荐(0)

TZOJ 1513 Farm Tour(最小费用最大流)

摘要: 描述 When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of whi 阅读全文

posted @ 2018-08-23 20:29 大桃桃 阅读(162) 评论(0) 推荐(0)

TZOJ 2018 SPF(连通图割点和分成的连通块)

摘要: 描述 Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis 阅读全文

posted @ 2018-08-23 20:18 大桃桃 阅读(328) 评论(0) 推荐(0)

导航