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, 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,2?24??). 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 <iostream>
2 #include <algorithm>
3 #include <cstdio>
4 #include <cstring>
5 #include <map>
6 #include <stack>
7 #include <vector>
8 #include <queue>
9 #include <set>
10 #define LL long long
11 using namespace std;
12 const int MAX = 1e7 + 1;
13
14 int n, m, t, a, ans;
15 bool flag = false;
16 map <int, int> mp;
17
18 int main()
19 {
20 // freopen("Date1.txt", "r", stdin);
21 scanf("%d%d", &n, &m);
22 t = ((n * m) & 1 ? ((n * m) / 2) + 1 : ((n * m) / 2));
23 for (int i = 0; i < m; ++ i)
24 for (int j = 0; j < n; ++ j)
25 {
26 scanf("%d", &a);
27 if (flag) continue;
28 mp[a] ++;
29 if (mp[a] >= t)
30 {
31 flag = true;
32 ans = a;
33 }
34 }
35 printf("%d\n", ans);
36 return 0;
37 }
原文地址：https://www.cnblogs.com/GetcharZp/p/9589405.html