PAT 甲级 1054 The Dominant Color_pat甲级1054 java-CSDN博客

本文链接：https://blog.csdn.net/a845717607/article/details/86696067

本文介绍了一个简单的问题，即在给定的图像中找到占据超过一半面积的严格主导颜色。输入包括图像的分辨率和每个像素的颜色值，输出则是该主导颜色的值。通过使用map来计数每种颜色出现的次数，可以有效地解决这个问题。

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

1054 The Dominant Color （20 point(s)）

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, 800×600), 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,224). 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:

经验总结：

emmmm，简单的划水题，就不多说啦~~

AC代码

#include <cstdio>
#include <map>
using namespace std;

int main()
{
	int n,m,t;
	map<int,int> mp;
	scanf("%d %d",&m,&n);
	for(int i=0;i<n;++i)
	{
		for(int j=0;j<m;++j)
		{
			scanf("%d",&t);
			if(mp.count(t)==0)
				mp[t]=1;
			else
				++mp[t];
		}
	}
	int x=m*n/2;
	for(map<int,int>::iterator it=mp.begin();it!=mp.end();++it)
	{
		if(it->second>x)
		{
			printf("%d\n",it->first);
			break;
		}
	}
	return 0;
}