1054 The Dominant Color (20分)
作者:CHEN, Yue
单位:浙江大学
代码长度限制:16 KB
时间限制:400 ms
内存限制:64 MB
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
题意:
求所给数字矩阵中出现最多的数字。
思路:
利用哈希表统计出现个数,出处哈希表的位置。
参考代码:
#include <iostream>
#include <algorithm>
using namespace std;
int hashtable[4096*4096+1]={0};
int main()
{
int m,n,temp;
scanf("%d%d",&m,&n);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
scanf("%d",&temp);
hashtable[temp]++;
}
}
printf("%d\n",max_element(hashtable,hashtable+2048*2048+1)-hashtable);
return 0;
}
如有错误,欢迎指正