PAT 1054. The Dominant Color (20)

最新推荐文章于 2022-07-19 11:02:23 发布

chenxli23

最新推荐文章于 2022-07-19 11:02:23 发布

阅读量100

点赞数

CC 4.0 BY-SA版权

文章标签： PAT

本文链接：https://blog.youkuaiyun.com/Hickey_Chen/article/details/79661624

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

摘要生成于 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, 2²⁴). 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:

用scanf!用scanf!用scanf!

#include <iostream>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int main()
{
  int n,m;
  cin>>n>>m;
  map<int,int> Map;
  int max = -1;
  int val;
  for(int i = 0; i < m; i++)
  {
     for(int j = 0; j < n; j++)
     {
       int s;
       scanf("%d",&s);
       Map[s]++;
       if(Map[s] > max)
        {
          max = Map[s];
          val = s;
        }
     }
  }
  cout<<val<<endl;
  return 0;
}