1054 The Dominant Color（20 分）

1054 The Dominant Color（20 分）
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 (≤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.

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<cstdio>
#include<map>
using namespace std;
int main(){int n,m,ans,temp;map<int,int>mp;scanf("%d%d",&m,&n);for(int i=0;i<n;i++){for(int j=0;j<m;j++){scanf("%d",&temp);if(mp.find(temp)!=mp.end()  )   mp[temp]++;else mp[temp]=1;if(mp[temp]*2>n*m) ans=temp;}}printf("%d",ans);return 0;
}

1054 The Dominant Color（20 分）相关推荐

【PAT (Advanced Level) Practice】1054 The Dominant Color (20 分)
1054 The Dominant Color (20 分) Behind the scenes in the computer's memory, color is always talked ab ...
PAT_（STL使用）map-1100 Mars Numbers (20分)-1054 The Dominant Color (20分)-1071-1022
目录 1100 Mars Numbers (20分) 1054 The Dominant Color (20分) 1071 Speech Patterns (25分) 1022 Digital Lib ...
1054 The Dominant Color (20 分)_12行代码AC
立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 Behind the scenes in the computer's memory, color is always talke ...
1054 The Dominant Color (20 分)【难度: 简单 / 知识点: 思维】
https://pintia.cn/problem-sets/994805342720868352/problems/994805422639136768 因为数量多于一半,故排序后中间必为答案. # ...
【PAT甲级找到出现次数过半的数字】1054 The Dominant Color (20 分) C++
题目思路用数组模拟维护一个栈,栈内存储的数据有两个属性:数字.数量. 读取数字,如果数字已存在,相应位置上的数量+1 如果数字不存在,新建这个数字,size++,相应位置上的数量设置为1 题解 C ...
1054. The Dominant Color (20)
时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Behind the scenes in the compute ...
PAT甲级1054 The Dominant Color：[C++题解]哈希表、水题
文章目录题目分析题目链接题目分析来源:acwing AC代码 #include<bits/stdc++.h> using namespace std; const int N = ...
1054 The Dominant Color
1. 此题用到了map<string,int>将输入的颜色(long long也存不下,只好作为string存入)的次数记录,看来默认一个没出现过的string对应的int是0.因此记次数 ...
PTA 1054 求平均值 (20 分)
文章目录 code1 18分 code2 20分注意点 code1 18分 #include<iostream> #include<string.h> using names ...
C++学习之路 | PTA乙级—— 1068 万绿丛中一点红 (20 分)（精简）
1068 万绿丛中一点红 (20 分) 对于计算机而言,颜色不过是像素点对应的一个 24 位的数值.现给定一幅分辨率为 M×N 的画,要求你找出万绿丛中的一点红,即有独一无二颜色的那个像素点,并且该点 ...

1054 The Dominant Color（20 分）

1054 The Dominant Color（20 分）相关推荐

最新文章

热门文章