![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
网络流
大橘为重eleven
每天都因为自己太菜了而自闭
展开
-
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 awhile and takes quite a long time to regrow. Th...原创 2019-09-07 21:14:51 · 182 阅读 · 0 评论 -
Courses(hdu 1083)
题目描述:Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students ...原创 2019-09-23 09:35:58 · 205 阅读 · 0 评论 -
Antenna Placement
题目描述:The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discovery o...原创 2019-09-25 09:29:07 · 199 阅读 · 0 评论 -
Treasure Exploration
题目描述:Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would nev...原创 2019-09-29 22:12:33 · 177 阅读 · 0 评论 -
无题II
题目链接题目描述:这是一个简单的游戏,在一个n*n的矩阵中,找n个数使得这n个数都在不同的行和列里并且要求这n个数中的最大值和最小值的差值最小。输入:输入一个整数T表示T组数据。对于每组数据第一行输入一个正整数n(1<=n<=100)表示矩阵的大小。接着输入n行,每行n个数x(0<=x<=100)。输出:对于每组数据输出一个数表示最小差值。样...原创 2019-10-08 22:14:55 · 428 阅读 · 0 评论