PAT甲级 1054 The Dominant Color(20) (STL)

最新推荐文章于 2024-05-19 18:08:06 发布

NHS6671

最新推荐文章于 2024-05-19 18:08:06 发布

阅读量103

点赞数

分类专栏： PAT-甲级文章标签：职场和发展 pat考试算法 c++

本文链接：https://blog.csdn.net/NHS6671/article/details/125050009

版权

PAT-甲级专栏收录该内容

70 篇文章 0 订阅

订阅专栏

题目

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.

输入

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^{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.

输出

For each test case, simply print the dominant color in a line.

样例输入

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

样例输出

24

题意理解

一句话概况就是找出重复次数最多的那个数因为数字很大所以我们直接用字符串存数即可

我们直接用哈希的思想记录一下数量即可

本题非常的简单。。。

代码

#include<bits/stdc++.h>
using namespace std;
const int N=810;
int g[N][N];
int n,m;
map<string,int>ma;
string ans;
int cnt;
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
       for(int j=1;j<=m;j++){
           string x;
           cin>>x;
           ma[x]++;
           if(ma[x]>cnt){
               ans=x;cnt=ma[x];
           }
       }
    }
    cout<<ans<<endl;
    return 0;
}