1054 The Dominant Color 之 map与哈希（hash）初级

题目

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.

分析

题意是让我们找出一张照片的主颜色，这个主颜色就是用像素表示，规定只要这个像素出现次数超过半数就是主颜色。很简单啊，只要记录每个像素出现的次数，跟出现总次数的一半一比就出来了，来看代码：

#include<iostream>
using namespace std;
const int maxv = 100000000;
int A[maxv];
int main()
{
	int n, m; scanf("%d%d", &n, &m);
	int d, half = n*m/2;
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < m; j++)
		{
			scanf("%d", &d);
			A[d]++;
			if(A[d] > half)
			{
				printf("%d", d);
				return 0;
			}
		}
	}
}

这里用到了哈希表的思想，如果这道题出难一点，像素不是用数字表示，那该怎么办？聪明的你一定想到，我不建立数组的哈希表，我建立map<string, int>也是一样可以喔哈哈。

小结

1. 哈希与map搭配也无敌。