浙江大学PAT_甲级_1054. The Dominant Color (20)

最新推荐文章于 2021-07-19 16:35:54 发布

原创最新推荐文章于 2021-07-19 16:35:54 发布 · 424 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#浙江大学 #数据结构 #PAT #C++

PAT甲级专栏收录该内容

38 篇文章

订阅专栏

本文深入探讨了计算机图像处理中的颜色识别方法，重点介绍了像素级别的信息如何转化为颜色比例，进而确定图像中的主导颜色。通过实例分析和代码实现，阐述了如何在给定分辨率的图像中找出严格主导的颜色。

题目链接:点击打开链接

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:

我的C++程序：

#include<iostream>
#include<map>
using namespace std;
int main()
{
	int m, n, i = 0;
	map<int, int>ma;//map的值统计数字出现次数
	int temp,max_value=0;
	scanf("%d %d", &m, &n);
	for (i = 0;i < m*n;i++)
	{
		scanf("%d", &temp);//输入数字
		ma[temp]++;
	}
	auto it = ma.begin();
	for (;it != ma.end();it++)//遍历map
	{
		if (it->second > max_value)
		{
			temp= it->first;////记录出现次数最多的数字
			max_value = it->second;//寻找最大出现次数
		}
	}
	printf("%d",temp);
	//system("pause");
	return 0;
}