PAT 1054 The Dominant Color-优快云博客

本文介绍了一种算法，用于从给定分辨率的图像中找出占据最大面积的严格主导颜色。通过使用C++和标准模板库(map)，算法遍历每个像素的颜色值并计数，最终输出出现次数最多的颜色。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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>
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
using namespace std;
int main()
{
    int M,N,x,Max_num=0,ans;
    scanf("%d %d",&M,&N);
    map<int,int> Map;

    while(N--)
    {
        for(int i=1;i<=M;i++)
        {
            scanf("%d",&x);
            Map[x]+=1;
            if(Map[x]>Max_num)
                ans=x;
        }
    }
    printf("%d",ans);
    return 0;
}