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, 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,$2^{24}$). 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<cstdio>
#include<map>
#include<iostream>
using namespace std;

int main()
{
    map<int,int> mp;
    //对应数字，和数字出现的次数
    int n,m,temp,maxnum=0,color=0;
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            scanf("%d",&temp);
            if(mp.find(temp)!=mp.end())
                mp[temp]++;//元素已经存在
            else
                mp[temp]=1;
        }    
    }
    //迭代器访问
    for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
    {
       //it->second 可以表示键值对中的值
       //it->first 可以表示键值对中的键
        if(it->second>maxnum){
            maxnum=it->second;
            color=it->first;
        }
    }
    cout<<color<<endl;
    return 0;
}