1054 The Dominant Color (20分)

最新推荐文章于 2022-11-16 22:18:30 发布

李小白~

最新推荐文章于 2022-11-16 22:18:30 发布

阅读量75

点赞数

分类专栏： PAT（甲级）文章标签：算法

本文链接：https://blog.csdn.net/qq_40941722/article/details/104394686

版权

PAT（甲级）专栏收录该内容

130 篇文章 10 订阅

订阅专栏

题目

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(\le800)$ and $N(\le600)$ 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 <iostream>
#include <cstdio>
#include <map>
using namespace std;

int main(){
    map<int,int> mp;
    int m, n;
    scanf("%d%d", &m, &n);
    for(int i=0; i<n; i++)
        for(int j=0, t; j<m; j++){
            scanf("%d", &t);
            if(mp.find(t) != mp.end())
                mp[t]++;
            else
                mp[t] = 1;
        }
    int key, maxs = 0;
    for(map<int,int>::iterator it=mp.begin(); it!=mp.end(); it++)
        if(it->second > maxs){
            key = it->first;
            maxs = it->second;
        }
    printf("%d\n", key);
    return 0;
}