【PAT甲级】The Dominant Color

最新推荐文章于 2024-02-28 10:43:40 发布

原创最新推荐文章于 2024-02-28 10:43:40 发布 · 685 阅读

0 ·

CC 4.0 BY-SA版权

C++ 同时被 2 个专栏收录

368 篇文章

订阅专栏

PAT甲级

33 篇文章

订阅专栏

本文介绍了一种算法，用于从给定的图像中找出占据超过一半面积的严格主导颜色。通过使用map记录每个颜色值出现的次数，算法能有效地找出并输出主导颜色。

Problem Description：

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 Mby 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:

解题思路：

无脑用map记录每个数字出现的次数，maxans记录出现最多的那个数，maxcnt记录出现最多的那个数出现的次数，最后输出maxans即可。

AC代码：

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int M,N;   //N行M列
    cin >> M >> N;
    map<int, int> m;   //map的key是数字,map的cnt是这个数字出现的次数
    int maxans, maxcnt = -1e5;  //出现最多的那个数maxans,出现最多的那个数出现的次数maxcnt
    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < M; j++)
        {
            int temp;
            cin >> temp;
            m[temp]++;
            if(m[temp] > maxcnt)   //更新出现最多的那个数
            {
                maxcnt = m[temp];
                maxans = temp;
            }
        }
    }
    cout << maxans << endl;
    return 0;
}