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

#include<cstdio>#include<map>using namespace std;map<int,int> col;int main(){    int n,m;    scanf("%d %d",&n,&m);    for(int i=0;i<m;i++){        for(int j=0;j<n;j++){            int c;            scanf("%d",&c);            if(col.find(c)==col.end()){                col[c]=1;            } else{                col[c]++;            }        }     }    int max_key;    int max_val=-1;    for(map<int,int>::iterator it=col.begin();it!=col.end();it++){        if(it->second>max_val){            max_val=it->second;            max_key=it->first;        }    }    printf("%d\n",max_key);    return 0;}

法二：

#include<cstdio>const int maxm=100000010;int num[maxm]={0};int main(){    int n,m;    scanf("%d %d",&n,&m);    int max=-1;    for(int i=0;i<m;i++){        for(int j=0;j<n;j++){            int x;            scanf("%d",&x);            if(x>max){                max=x;            }            num[x]++;        }    }    int max_i,max_num=-1;    for(int i=0;i<=max;i++){        if(num[i]>max_num){            max_num=num[i];            max_i=i;        }    }    printf("%d\n",max_i);    return 0;}