![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_二分图匹配
文章平均质量分 80
ACM_sjtsjt
不忘初心 追求美好
展开
-
hdu 1150 Machine Schedule(求最小点覆盖)
Machine ScheduleProblem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widel原创 2016-02-20 18:55:48 · 313 阅读 · 0 评论 -
hdu 1151 Air Raid(最小路径覆盖)
Air RaidProblem DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walki原创 2016-02-21 10:24:03 · 285 阅读 · 0 评论 -
hdu 1281(二分图求匹配)
棋盘游戏Problem Description小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋原创 2016-02-21 10:42:36 · 314 阅读 · 0 评论 -
hdu 1068 girls and boys(二分图求最大独立集)
Girls and BoysProblem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between原创 2016-02-21 13:18:05 · 538 阅读 · 0 评论