Farm Irrigation（ZOJ - 2412 ）农田灌溉

原创

于 2020-07-24 18:26:18 发布 · 375 阅读

CC 4.0 BY-SA版权

本文介绍了如何解决ZOJ - 2412题目——农田灌溉问题，即在一个由不同类型的水管组成的矩形农场中，确定最少需要多少个水源来灌溉整个农场。通过使用深度优先搜索（DFS）算法，可以跟踪并记录各个位置的连通性，从而找到答案。题目要求输出最少的水源数量，并提供了样例输入和输出。

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

Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of pipe. There are 11 types of pipes, which is marked from A to K, as Figure 1 shows.

Benny has a map of his farm, which is an array of marks denoting the distribution of water pipes over the whole farm. For example, if he has a map
ADC
FJK
IHE
then the water pipes are distributed like

Several wellsprings are found in the center of some squares, so water can flow along the pipes from one square to another. If water flow crosses one square, the whole farm land in thi