1054 The Dominant Color (20 分)

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, 8), 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 (≤) and N (≤) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0). 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

这种纯暴力都能过，
虽然数据结构书上有一种找过半的那个算法，
在但是麻烦呐。

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 int x;
 5 int an[(2<<24) + 10];
 6 int n,m;
 7 
 8 int main(){
 9     scanf("%d%d", &n,&m);
10     for(int i = 0; i < m; i ++){
11         for(int j = 0 ; j < n; j++){
12             scanf("%d", &x);
13             an[x]++;
14         }
15     }
16     for(int i = 0; i <= (2<<24); i++){
17         if(an[i] > (n*m)/2){
18             printf("%d\n", i);
19             return 0;
20         }
21     }
22     return 0;
23 }

 

转载于:https://www.cnblogs.com/zllwxm123/p/11185938.html