1054 The Dominant Color （20 分）

最新推荐文章于 2025-01-10 19:41:30 发布

SourDumplings

最新推荐文章于 2025-01-10 19:41:30 发布

阅读量89

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT甲级真题练习

本文链接：https://blog.youkuaiyun.com/SourDumplings/article/details/87886548

PAT甲级真题练习专栏收录该内容

165 篇文章

订阅专栏

本文介绍了一种算法，用于从给定分辨率的图像中找出占据最大比例面积的严格主导颜色。通过读取图像的每个像素的颜色值并进行计数，算法能够确定并输出主导颜色。

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:

C++:

/*
 @Date    : 2018-01-28 16:36:54
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1054
 */

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int main(int argc, char const *argv[])
{
    int N, M;
    scanf("%d %d", &N, &M);
    map<int, int> data;
    int c;
    int maxc, maxf = 0;
    for (int i = 0; i != N; ++i)
    {
        for (int j = 0; j != M; ++j)
        {
            scanf("%d", &c);
            ++data[c];
            if (data[c] > maxf)
            {
                maxf = data[c];
                maxc = c;
            }
        }
    }
    printf("%d\n", maxc);
    return 0;
}