- 博客(2)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 二分图(bfs+匈牙利算法)
<br />COURSESTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8075 Accepted: 3207<br />DescriptionConsider 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 possibl
2010-09-05 17:27:00
440
1
原创 二分图匹配(最小费用完美匹配) poj 2195 GoingHome
Going HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9224 Accepted: 4752DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjac
2010-09-05 17:07:00
1220
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人