POJ 3041 Asteroids（匈牙利算法）

最新推荐文章于 2021-02-16 10:40:23 发布

原创

最新推荐文章于 2021-02-16 10:40:23 发布 · 309 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#poj #Cpp #最小覆盖 #二分图匹配 #匈牙利算法

博客介绍了如何利用匈牙利算法解决POJ 3041 Asteroids问题，这是一个关于求解二分图最小覆盖数的题目。文章通过给出的反例说明贪心法的不适用，并详细阐述了如何构建二分图以及正确应用匈牙利算法。同时，博主指出了在实现匈牙利算法时需要注意的细节，例如邻接表的大小和访问标记数组的初始化。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目来源：http://poj.org/problem?id=3041

问题描述

Asteroids

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 26626		Accepted: 14359

Description

Bessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conveniently located at the lattice points of the grid.

Fortunately, Bessie has a powerful weapon that can vaporize all the asteroids in any given row or column of the grid with a single shot. This weapon is quite expensive, so she wishes to use it sparingly. Given the location of all the astero