PAT A1054：The Dominant Color之map求解

题目描述

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

24

求解思路

用map实现从数字到数字出现的次数的映射，每次都拿出现的次数与半数对比，如果大于半数则更新。

代码实现(AC)

#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
int n,m;
map<int,int>mp;	//键是id，值是数目 
void solve()
{
	int tmp,ans;
	scanf("%d %d",&m,&n);
	int half=m*n/2;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			scanf("%d",&tmp);
			mp[tmp]++;
			if(mp[tmp]>half)	ans=tmp;
		}
	}
	printf("%d",ans);
}
int main()
{
	solve();
	return 0;	
}