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 #define _CRT_SECURE_NO_WARNINGS
 2 #include <climits>
 3 #include<iostream>
 4 #include<vector>
 5 #include<queue>
 6 #include<map>
 7 #include<set>
 8 #include<stack>
 9 #include<algorithm>
10 #include<string>
11 #include<cmath>
12 using namespace std;
13 
14 int main()
15 {
16     map<string, int> Map;
17     int N, M;
18     cin >> N >> M;
19     for (int i = 0; i < M; i++)
20     {
21         for (int j = 0; j < N; j++)
22         {
23             string s;
24             cin >> s;
25             Map[s]++;
26         }
27     }
28     int Max = 0;
29     string s;
30     for(auto it:Map)
31         if (it.second > Max)
32         {
33             Max = it.second;
34             s = it.first;
35         }
36     cout << s;
37 }

View Code

1054 The Dominant Color (20分)(水)

原文：https://www.cnblogs.com/57one/p/12050688.html