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,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
题意:给定一个NM的矩阵,往里面输入数据,求这个矩阵中占NM/2以上的元素是谁;
思路:创建一个map<int,int>,与矩阵里面的元素对应;
AC
#include<stdio.h>
#include<map>
using namespace std;
int main(){
map<int,int>mp;
int m,n;
scanf("%d%d",&m,&n);
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
int temp;
scanf("%d",&temp);
if(mp.find(temp)!=mp.end())mp[temp]++;//寻找元素temptemp
else mp[temp]=1;//找不到,初始化元素
}
}
int max=-1,k;
map<int,int>::iterator it;
for(it=mp.begin();it!=mp.end();it++){
if(it->second>max){
k=it->first;
max=it->second;
}
}
printf("%d\n",k);
}