Not Only Algorithm,不仅仅是算法,关注数学、算法、数据结构、程序员笔试面试以及一切涉及计算机编程之美的内容 。。
你的位置:NoAlGo博客 » 题解 » 

PAT 1054. The Dominant Color

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 (<=800) and N (<=600) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0, 224). 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 <map>
using namespace std;

int main()
	map<int, int> mp;
	int n, m, t; scanf("%d%d", &n, &m);
	for (int i = 0; i < n*m; i++)
		scanf("%d", &t), mp[t]++;
	int mxcnt = -1, ans;
	for (auto p = mp.begin(); p != mp.end(); p++) 
		if (p->second > mxcnt) mxcnt = p->second, ans = p->first;
	printf("%d\n", ans);
	return 0;
上一篇: 下一篇: