二分图匹配
broxin
这个作者很懒,什么都没留下…
展开
-
ZOJ1654 place the robots(二分图匹配)
Mem:32MB time:5s Robert is a famous engineer. One day he was given a task by his boss. The background of the task was the following: Given a map consisting of square blocks. There were three kin原创 2015-07-27 16:49:27 · 545 阅读 · 0 评论 -
zoj1002 FireNet 火力网 C++ 二分图匹配
题目描述 给出一个N*N的网格,用'.'表示空地,用'X'表示墙。在网格上放碉堡,可以控制所在的行和列,但不能穿过墙。 问:最多能放多少个碉堡? 例如,下图最多可放5个碉堡(黑色圆点) 样例输入 4 .X.. .... XX.. .... 2 XX .X 3 .X. X.X .X. 3 ... .XX .XX 4 .... ....原创 2013-08-04 21:40:45 · 1918 阅读 · 0 评论 -
hdu2819 swap(二分图匹配)
Description Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1? Input T原创 2015-07-28 16:08:32 · 580 阅读 · 0 评论