1054 The Dominant Color
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
总结:题目就是要你求出出现次数最多的颜色值,首首先肯定不能用数组来存放颜色的值,会超内存,使用map来存是一个不错的选择
#include <iostream>
#include <map>
using namespace std;
int main(){
int n,m;
map<int,int> v;
scanf("%d%d",&n,&m);
int t,max=0;
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
scanf("%d",&t);
v[t]++;
max=v[t]>v[max]?t:max;
}
}
printf("%d\n",max);
return 0;
}
好好学习,天天向上!
我要考研!