1054 The Dominant Color （20 分）哈希表+map的运用

最新推荐文章于 2022-04-18 12:51:18 发布

大山喵

最新推荐文章于 2022-04-18 12:51:18 发布

阅读量401

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT-Advanced Level 文章标签： A1054

本文链接：https://blog.csdn.net/CV_Jason/article/details/85227336

PAT-Advanced Level 专栏收录该内容

69 篇文章

订阅专栏

本文介绍了一种使用哈希表（具体为C++的map）来解决PAT高级1054题目中图像主色识别的问题。通过遍历输入的图像像素颜色值，统计每种颜色出现的频率，最终找出出现次数最多的颜色作为主色。

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

题目

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 (\leq 800)$ and $N (\leq 600)$ which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range $0,2^{24})$ . 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:

24

解题思路

　　题目大意： 给你一个 $M x N$ 分辨率大小的图像，定义超过一半数量的色度值为主色，计算该主色。
　　解题思路： 运用哈希表的思想，直接用map统计主色即可。

/*
** @Brief:No.1054 of PAT advanced level.
** @Author:Jason.Lee
** @Date:2018-12-21
** @Solution: https://blog.csdn.net/CV_Jason/article/details/85227336
*/
#include<iostream>
#include<map>
#include<algorithm>
using namespace std;

int main(){
	int M,N,value;
	while(cin>>M>>N){
		map<int,int> image;
		for(int i=0;i<M*N;i++){
			scanf("%d",&value);
			image[value]++;
		}
		
		int max = 0;
		int dominant = 0;
		for(auto elem:image){
			//cout<<"elem.first = "<<elem.first<<"  elem.second = "<<elem.second<<endl;
			if(elem.second>max){
				dominant = elem.first;
				max = elem.second;
				//cout<<"max = "<<max<<" dominant = "<<dominant<<endl;
			}
		}
		printf("%d\n",dominant);
	}
	return 0;
}