PAT.A1054 The Dominant Color

最新推荐文章于 2023-03-15 17:04:58 发布

克拉拉123

最新推荐文章于 2023-03-15 17:04:58 发布

阅读量109

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/mokena1/article/details/80906618

本文介绍了一个算法，用于从给定分辨率的图像中找出占据超过一半面积的严格主导颜色。通过使用映射来跟踪每种颜色出现的次数，并最终确定哪种颜色出现最频繁。

摘要生成于 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, 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:

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<set>
#include<map>
#include<utility>
using namespace std;

int main() {
	map<int, int> color;
	int m, n;
	cin >> m >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			int tmp;
			scanf("%d",&tmp);
			if (color.find(tmp) != color.end())
				color[tmp]++;
			else
				color[tmp] = 1;
		}
	}
	map<int, int>::iterator it;
	int maxi=-1;
	int max;
	for (it = color.begin(); it != color.end(); it++) {
		//cout << it->first << " " << it->second << "\n";
		if (it->second > maxi) {
			maxi = it->second;
			max = it->first;
		}
	}
	cout << max;
	return 0;
}