1054 The Dominant Color（20 分）

最新推荐文章于 2021-08-02 15:47:08 发布

ChenyutingZJU

最新推荐文章于 2021-08-02 15:47:08 发布

阅读量213

点赞数

分类专栏： PAT甲级

本文链接：https://blog.youkuaiyun.com/chenyutingdaima/article/details/82253585

版权

PAT甲级专栏收录该内容

54 篇文章

订阅专栏

博客围绕图像主颜色判断问题展开，给定分辨率为M×N的图像，要求找出严格主颜色（占比超一半）。输入包含图像分辨率及各像素颜色，输出为主颜色。解题时简单用数组会超内存，需用map映射。

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

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

解题思路：
简单使用数组的话会超内存，要用map映射。

#include<cstdio>
#include<map>
using namespace std;
int main(){
    int n,m,ans,temp;
    map<int,int>mp;
    scanf("%d%d",&m,&n);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            scanf("%d",&temp);
            if(mp.find(temp)!=mp.end()  )   mp[temp]++;
            else mp[temp]=1;
            if(mp[temp]*2>n*m) ans=temp;
        }
    }
    printf("%d",ans);
    return 0;
}