A1054.The Dominant Color

最新推荐文章于 2022-05-23 00:13:57 发布

蜗牛嘻嘻

最新推荐文章于 2022-05-23 00:13:57 发布

阅读量253

点赞数

CC 4.0 BY-SA版权

分类专栏：浙大pat甲级

本文链接：https://blog.youkuaiyun.com/chenghao_test/article/details/70208139

浙大pat甲级专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种算法，用于从给定分辨率的图像中找出占据面积超过一半的严格主导颜色。通过遍历像素并使用哈希映射来跟踪每种颜色出现的次数，最终确定主导颜色。

摘要生成于 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, 800x600), 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:
24

Code:

#include "cstdio"
#include "map"

using namespace std;

int main()
{
    int n,m,col;
    scanf("%d%d",&n,&m);
    map<int,int> mp;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m; j++)
        {
            scanf("%d",&col);
            if(mp.find(col) != mp.end())
            {
                mp[col]++;
            }
            else
            {
                mp[col] = 1;
            }
        }
    }

    int k = 0, MAX = 0;
    for(map<int,int>::iterator it = mp.begin(); it != mp.end(); it++)
    {
       if(it->second > MAX)
       {
           k = it->first;
           MAX = it->second;
       }
    }
    printf("%d\n",k);
    return 0;
}