阅读背景:

POJ3041 最小点覆盖 最大匹配数 回顾匈牙利算法

来源:互联网 

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.  Bessie wants to navigate her



你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: