【PAT甲级】The Dominant Color

2019 年 11 月 8 日
筆記

本文链接：https://blog.csdn.net/weixin_42449444/article/details/89436173

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;  }