1054 The Dominant Color 20

最新推荐文章于 2024-09-07 05:15:02 发布

Ardespair

最新推荐文章于 2024-09-07 05:15:02 发布

阅读量69

点赞数

分类专栏： PAT甲级文章标签： c++ 算法

本文链接：https://blog.csdn.net/number404/article/details/125550042

版权

PAT甲级专栏收录该内容

14 篇文章 0 订阅

订阅专栏

该问题描述了一个计算机图像处理的任务，要求从24位颜色信息的像素中找出严格占主导地位的颜色。输入包含图像的分辨率和每个像素的RGB值，输出是最频繁出现的颜色。程序通过读取和计数每种颜色的出现次数，找到占比超过一半的颜色作为答案。

摘要由CSDN通过智能技术生成

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 \times 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 (\leq 800)$ and $N (\leq 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:

问题思路

本题大意为:给定一个图片的像素分布，求其中占据主要比例的颜色。

$M\times N$ 最多为 $800\times 600$ ，因此不用理会高达 $2^{24}\times 4 Bytes$ 的唬人数据。读入输入的颜色，找出其中出现频率最高的即可。

源码

#include<cstdio>
#include<map>
using namespace std;

int main()
{
    map<int, int> color_porp;
    int M, N, color;
    scanf("%d %d", &M, &N);
    for(int i=0; i<N; i++)
    {
        for(int j=0; j<M; j++)
        {
            scanf("%d", &color);
            if(color_porp.find(color) == color_porp.end()){
                color_porp[color]=1;
            }else{
                color_porp[color]++;
            }
        }
    }

    auto max=color_porp.begin();
    for(auto s=++color_porp.begin(); s != color_porp.end(); s++)
    {
        if(s->second > max->second)
            max = s;
    }
    printf("%d", max->first);

    return 0;
}