1054. The Dominant Color

最新推荐文章于 2022-02-17 14:09:46 发布

原创最新推荐文章于 2022-02-17 14:09:46 发布 · 257 阅读

0 ·

CC 4.0 BY-SA版权

PAT A C语言实现专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一个算法，用于找出图像中占据超过一半面积的严格主导颜色。输入包含图像的分辨率及每个像素的颜色值，输出为该主导颜色。

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

1054. The Dominant Color (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Behind the scenes in the computer's memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the dominant color. A strictly dominant color takes more than half of the total area. Now given an image of resolution M by N (for example, 800x600), you are supposed to point out the strictly dominant color.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: M (<=800) and N (<=600) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0, 2²⁴). It is guaranteed that the strictly dominant color exists for each input image. All the numbers in a line are separated by a space.

Output Specification:

For each test case, simply print the dominant color in a line.

Sample Input:

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

Sample Output:

这道题和剑指offer上的一道题很像，只需要遍历一遍就可以了。

#include<stdio.h>

int main()
{
	freopen("F://Temp/input.txt", "r", stdin);
	int m, n;
	scanf("%d%d", &m, &n);
	
	int ans = -1, index = 0;

	for(int i = 0; i < n*m; i ++)
	{
		int tmp;
		scanf("%d", &tmp);
		if(ans == -1)
			ans = tmp;
		else if(ans == tmp)
			index ++;
		else if(ans != tmp)
		{
			if(index != 0)
				index --;
			else
				ans = tmp;
		}		
	}
	
	printf("%d\n", ans);
	return 0;
}