PAT: 1054. The Dominant Color (20)

最新推荐文章于 2022-11-16 22:18:30 发布

置顶 J_24K

最新推荐文章于 2022-11-16 22:18:30 发布

阅读量1.2k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：浙江大学机试试题文章标签： map

本文链接：https://blog.youkuaiyun.com/ZJFCLH/article/details/21749019

浙江大学机试试题专栏收录该内容

36 篇文章

订阅专栏

本文深入探讨图像处理与算法应用的关键技术，包括图像色彩空间、视频编解码算法、OpenCV图像处理等核心概念，旨在帮助开发者掌握图像处理领域的最新进展与实践技巧。

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

1054. The Dominant Color (20)

时间限制

100 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

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:

AC代码：

//此题用map再适合不过了

#include<stdio.h>
#include<map>
using namespace std;

int main()
{
    //freopen("in.txt","r",stdin);
    int m, n;
	map<int,int> dc;
	map<int,int>::iterator it; //定义迭代器
	while(scanf("%d %d",&m,&n)!=EOF) {	
		int i, j, a;
		for(i=0; i<n; i++) {
			for(j=0; j<m; j++) {
				scanf("%d",&a);
				dc[a]++; //用数组方式进行插入
			}
		}
		for(it=dc.begin(); it!=dc.end(); it++) {
			if(it->second > n*m/2) {
				//A strictly dominant color takes more than half of the total area.
				printf("%d\n",it->first);
				break;
			}
		}
	}

    return 0;
}