A1054 The Dominant Color (20 point(s))

记录数组出现个数，取超过一半的数

1. 原文

原题

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:

24

2. AC代码

#include<cstdio>
#include<map>
using namespace std;
map<int,int> match;
int main()
{
	int m,n;
	scanf("%d%d",&m,&n);
	for (int i = 0; i < m; ++i)
	{
		for (int j = 0; j < n; ++j)
		{
			int a;
			scanf("%d",&a);
			match[a]++;
		}
	}
	for (map<int,int>::iterator i = match.begin(); i != match.end(); ++i)
	{
		if (i->second>(m*n/2))
		{
			printf("%d\n", i->first);
			break;
		}
	}
	return 0;
}