原题链接:http://poj.org/problem?id=3041题目来源:http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法:匈牙利算法(二分匹配,求最小点覆盖数)AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field Read More
原题链接:http://poj.org/problem?id=3041题目来源:http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法:匈牙利算法(二分匹配,求最小点覆盖数)AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field Read More