POJ 3051 Satellite Photographs 图的连通块，dfs即可。大水题。

最新推荐文章于 2021-04-24 20:24:29 发布

zck921031

最新推荐文章于 2021-04-24 20:24:29 发布

阅读量1.3k

点赞数

CC 4.0 BY-SA版权

分类专栏：简单题图论文章标签： shapes each fun struct output pair

本文链接：https://blog.youkuaiyun.com/zck921031/article/details/7688996

博客内容介绍了如何使用深度优先搜索（DFS）算法来计算图中的连通块大小，通过示例输入和输出展示了算法的应用。

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

用dfs算出每个连通块的大小即可

Description

Farmer John purchased satellite photos of W x H pixels of his farm (1 <= W <= 80, 1 <= H <= 1000) and wishes to determine the largest 'contiguous' (connected) pasture. Pastures are contiguous when any pair of pixels in a pasture can be connected by traversing adjacent vertical or horizontal pixels that are part of the pasture. (It is easy to create pastures with very strange shapes, even circles that surround other circles.)

Each photo has been digitally enhanced to show pasture area as an asterisk ('*') and non-pasture area as a period ('.'). Here is a 10 x 5 sample satellite photo:

..*.....** .**..***** .*...*.... ..****.*** ..****.***

This photo shows three contiguous pastures of 4, 16, and 6 pixels. Help FJ find the largest contiguous pasture in each of his satellite photos.

Inp