POJ 3041 Asteroids（匈牙利算法）

da_kao_la

于 2018-09-14 11:31:04 发布

阅读量299

点赞数

分类专栏：百练OJ/poj 基础算法文章标签： poj Cpp 最小覆盖二分图匹配匈牙利算法

本文链接：https://blog.youkuaiyun.com/da_kao_la/article/details/82700144

版权

博客介绍了如何利用匈牙利算法解决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 asteroids in the field, find the minimum number of shots Bessie needs to fire to eliminate all of the asteroids.

最低0.47元/天解锁文章