1054. The Dominant Color (20)

​ 时间限制

​ 100 ms

​ 内存限制

​ 65536 kB

​ 代码长度限制

​ 16000 B

​ 判题程序

​ Standard

​ 作者

​ CHEN, Yue

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.

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

代码如下：

就是求最大值，利用了map

#include<iostream>
#include<map>
using namespace std;
int main(){
	int m,n;
	scanf("%d%d",&m,&n);
	map<long,int> m_color;
	long color;
	for(int i=0;i<n;++i){
		for(int j=0;j<m;++j){
			scanf("%ld",&color);
			m_color[color]++;		
		}
	}
	int max=0;
	long index=-1;
	for(auto i=m_color.begin();i!=m_color.end();++i){
		if(max<i->second) {
			max=i->second;
			index=i->first;
		}
	}
	printf("%ld",index);
	return 0;
}