PAT A1054 The Dominant Color

最新推荐文章于 2025-08-04 19:56:00 发布

原创最新推荐文章于 2025-08-04 19:56:00 发布 · 158 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT甲级 #c++

PAT甲级题解专栏收录该内容

65 篇文章

订阅专栏

1054 The Dominant Color

分数 20

作者 CHEN, Yue

单位浙江大学

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:

#include <iostream>

using namespace std;

const int N = 1 << 24;
int hs[N];

int main()
{
    int n, m;
    cin >> m >> n;
    for(int i=0; i<n; ++i)
        for(int j=0; j<m; ++j)
        {
            int v;
            cin >> v;
            hs[v]++;
        }
        
    int sum = n*m;
    for(int i=0; i<N; ++i)
        if(hs[i] > sum/2)
        {
            cout << i << endl;
            break;
        }
            
    return 0;
}