PAT (Advanced Level) Practice 1054

最新推荐文章于 2024-03-14 17:44:34 发布

原创最新推荐文章于 2024-03-14 17:44:34 发布 · 167 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #PAT1054 #PAT 1054

PAT_甲专栏收录该内容

32 篇文章

订阅专栏

本文介绍了一个算法，用于找出图像中占据超过一半面积的主导颜色。通过读取图像的分辨率及每个像素的颜色值，利用哈希映射来跟踪每种颜色出现的次数，最终输出占据最大比例的颜色。

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

1054 The Dominant Color (20)（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, 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^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:

题意：寻找出占整个空间一半多的具体整数，并输出。

code

#include<cstdio>
#include<map>
using namespace std;
map<int, int> mmap;
int main(){
	int M, N;
	scanf("%d%d", &M, &N);
	int half = M * N / 2;
	for(int i = 0;i < N;i++){
		for(int j = 0;j < M;j++){
			int t;
			scanf("%d", &t);
			mmap[t]++;
			if(mmap[t] > half){
				printf("%d", t);
				return 0;
			}
		}
	}
	return 0;
}