The Dominant Color (20)

The Dominant Color (20)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)
题目描述
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

题解：就是STL map的应用

#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define SZ(x) x.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)
#define pi acos(-1)
#define mod 1000000007
#define inf 1000000007
#define ll long long
#define DBG(x) cerr<<(#x)<<"="<<x<<"\n";
#define N 200010
template <class U,class T> void Max(U &x, T y){if(x<y)x=y;}
template <class U,class T> void Min(U &x, T y){if(x>y)x=y;}
template <class T> void add(int &a,T b){a=(a+b)%mod;}
map<int,int> hashmap;
int main()
{
    int m,n;
    cin>>m>>n;

    int mar;
    rep(i,0,n)
    {
        rep(j,0,m)
        {

            scanf("%d",&mar);
            hashmap[mar]++;
        }
    }

    int maxn=0;
    int ans=0;

    for(map<int,int>::iterator m=hashmap.begin();m!=hashmap.end();m++)
    {
        if(m->second>maxn)
        {
            maxn=m->second;
            ans=m->first;
        }
    }

    cout<<ans<<endl;
    return 0;

}