将石头随即放入矩阵中找出最小SubMatrix包含所有石头

leo524891010

于 2012-07-23 11:53:51 发布

阅读量883

点赞数

CC 4.0 BY-SA版权

文章标签： c

本文链接：https://blog.youkuaiyun.com/algorithmengine/article/details/7774781

本文介绍了一种算法，用于在一个随机放置石头的网格中找到覆盖所有石头所需的最小矩形区域。通过遍历矩阵并记录石头的位置来确定矩形的四个顶点。

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

/*
Consider you have a grid of size m x n. 
There are stones placed randomly in some of the squares of this grid. Design a way to find out minimum rectangular area which covers all the stones in this grid.
*/
#include <cstdlib>
#include <algorithm>

#define R 5
#define C 4


int main()
{
	int mat[R][C] = {{0, 0, 0, 0},
					 {0, 1, 0, 0},
					 {0, 0, 0, 1},
					 {1, 0, 0, 0},
					 {0, 0, 0, 0}};


	int i1 = R - 1, i2 = 0, j1 = C - 1, j2 = 0;

	for(int i = 0; i < R; i++)
		for(int j = 0; j < C; j++)
			if(mat[i][j] == 1)
			{
				i1 = std::min(i1, i);
				i2 = std::max(i2, i);
				j1 = std::min(j1, j);
				j2 = std::max(j2, j);
			}

	printf("(%d, %d), (%d, %d), (%d, %d), (%d, %d)", i1, j1, i1, j2, i2, j1, i2, j2);
	return 0;

}