【PAT】【Advanced Level】1054. The Dominant Color (20)

最新推荐文章于 2020-10-24 01:10:38 发布

old_杨

最新推荐文章于 2020-10-24 01:10:38 发布

阅读量307

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/oldyang95/article/details/76862429

PAT 专栏收录该内容

132 篇文章

订阅专栏

给定一个分辨率为MxN的图像，其中每个像素由24位信息表示颜色。图像中占据最大面积的颜色称为主导颜色，严格的主导颜色占据超过一半的总面积。输入包含M和N，以及N行M个[0, 224]范围内的颜色数字。输出图像的严格主导颜色。" 49739981,5553737,Ubuntu13.10安装后必做任务：Saucy Salamander优化指南,"['Linux发行版', 'Ubuntu', '操作系统', '系统优化']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1054. The Dominant Color (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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:

原题链接：

https://www.patest.cn/contests/pat-a-practise/1054

https://www.nowcoder.com/pat/5/problem/4093

思路：

map映射，vector记录，最后统计

CODE：

#include<cstdio>
#include<iostream>
#include<map>
#include<vector>
using namespace std;

map<int,int> ma1;
vector<int> v;

int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	
	int ma=0;
	int re=0;
	for (int i=0;i<m;i++)
		for (int j=0;j<n;j++)
		{
			int c;
			scanf("%d",&c);
			if (ma1[c]==0) v.push_back(c);
			ma1[c]=ma1[c]+1;
		}
	for (int i=0;i<v.size();i++)
	{
		if (ma1[v[i]]>ma)
		{
			ma=ma1[v[i]];
			re=v[i];
		}
	}
	printf("%d",re);
	return 0;
}