PAT (Advanced Level) 1054. The Dominant Color (20) 找过半的数，一次遍历

最新推荐文章于 2022-07-19 11:02:23 发布

原创最新推荐文章于 2022-07-19 11:02:23 发布 · 438 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #Advenced Level #1054 #The Dominant Color

PAT(Advanced Level) 专栏收录该内容

99 篇文章

订阅专栏

本文深入探讨了计算机图像处理中的颜色识别技术，重点介绍了像素级别的信息如何转化为24位的颜色信息，并通过实例展示了如何从给定图像中找出主导颜色。通过一次遍历的方法，有效地识别出图像中占比超过一半的主导颜色。

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:

每次去掉不同的两个数，最后剩下的就是过半的数。一次遍历即可。

/*2015.7.27cyq*/
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

//ifstream fin("case1.txt");
//#define cin fin

int main(){
	int N,M;
	cin>>N>>M;
	int screen=N*M;

	int domi;	
	int count=0;
	int x;
	for(int i=0;i<screen;i++){
		cin>>x;
		if(count==0){
			domi=x;
			count++;
		}else if(domi==x)
			count++;
		else
			count--;
	}
	cout<<domi;
	return 0;
}