题目描述
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, 800x600), you are supposed to point out the strictly dominant color.
输入描述:
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.
输出描述:
For each test case, simply print the dominant color in a line.
输入例子:
5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24
输出例子:
24
题目分析及代码实现
本题只需要找到数出现超过总数一半的数。想到用map来解决就很容易实现啦。
代码实现(C++版本)
#include <iostream>
#include <map>
using namespace std;
int main()
{
int m,n;
cin>>m>>n;
map<int,int> image;
int half = (m*n) /2;
for(int i =0;i<m*n;i++){
int num;
cin >> num;
image[num]++;
if(image[num]>half){
cout<< num<<endl;
break;
}
}
return 0;
}