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, 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

IDEA

1.使用map<int,int> 其中color作为key，color个数作为value（累加）

2.遍历map，找出最大值

CODE

#include<iostream>#include<map>#include<fstream>using namespace std;int main(){//freopen("input.txt","r",stdin);int m,n;cin>>m>>n;map<int,int> my_map;for(int i=0;i<n;i++){for(int j=0;j<m;j++){int x;cin>>x;my_map[x]++;//cout<<x<<" "<<my_map[x]<<endl;}}int max=0,result;map<int,int>::iterator it;for(it=my_map.begin();it!=my_map.end();it++){//cout<<it->first<<" "<<it->second<<endl;if(it->second>max){max=it->second;result=it->first;} }cout<<result;//fclose(stdin);return 0;}