摘要: Farmer John has N hills on his farm (1 <= N <= 1,000), each with an integer elevation in the range 0 .. 100. In the winter, since there is abundant sn 阅读全文
posted @ 2016-12-25 16:40 阿波罗2003 阅读(212) 评论(0) 推荐(0) 编辑
摘要: Farmer John's hobby of conducting high-energy physics experiments on weekends has backfired, causing N wormholes (2 <= N <= 12, N even) to materialize 阅读全文
posted @ 2016-12-25 16:29 阿波罗2003 阅读(448) 评论(0) 推荐(0) 编辑
摘要: 二分匹配传送门[here] 原题传送门[here] 题意大概说一下,就是有N头牛和M个牛棚,每头牛愿意住在一些牛棚,求最大能够满足多少头牛的要求。 很明显就是一道裸裸的二分图最大匹配,但是为了练练网络流(做其它的题的时候,神奇地re掉了,于是就写基础题了)的最大流算法,就做做这道题。 每一个牛都可一 阅读全文
posted @ 2016-12-25 16:10 阿波罗2003 阅读(212) 评论(0) 推荐(0) 编辑