1054. The Dominant Color (20)

最新推荐文章于 2022-04-18 12:51:18 发布

我是QQ浩

最新推荐文章于 2022-04-18 12:51:18 发布

阅读量240

点赞数

CC 4.0 BY-SA版权

分类专栏：浙大PAT 文章标签： pat

本文链接：https://blog.youkuaiyun.com/accbbbxx/article/details/48176963

浙大PAT 专栏收录该内容

96 篇文章

订阅专栏

本文提供了一道PAT甲级题目“严格主颜色”的解答思路及代码实现，该题要求从给定的图像中找出占据面积超过一半的严格主颜色。

摘要生成于 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. Astrictly 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:

思路很简单，计数即可。话说这题和某年408真题很像，但是那年真题不一定会有主元素。但是只是多了一次检验，所以说408真题放在PAT只有20分的难度吗。。。

#include<iostream>
using namespace std;
int main()
{
	int N,M;
	cin>>N>>M;
	int cnt=1,c;
	cin>>c;
	for(int i=1;i<N*M-1;i++)
	{
		int thisc;
		cin>>thisc;
		if(thisc==c)
		{
			cnt++;
		}
		else
		{
			cnt--;
			if(cnt<0)
			{
				c=thisc;
				cnt=1;
			}
		}
	}
	cout<<c;
	system("pause");
	return 0;
	
}