1054. The Dominant Color (20)

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

原创最新推荐文章于 2020-10-24 01:10:38 发布 · 362 阅读

0 ·

CC 4.0 BY-SA版权

浙大PAT解题报告专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种算法，用于从给定分辨率的图像中找出占据面积超过一半的严格主导颜色。通过读取输入文件中的像素颜色值并对其进行排序，该算法能够有效地确定主导颜色。

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:

/* 统计出现最多的数- -不能开2^24数组 MLE.
*/
#include "iostream"
#include "algorithm"
#include "cstring"
using namespace std;
int main() {
	int  n, m;
	int prev;
	int cnt = 1;
	int a[480001];
	bool flag = 0;
	scanf("%d%d", &m, &n);
	for (int i = 0; i < n*m; i++) {
		scanf("%d",&a[i]);
	}
	sort(a, a + n*m);
	prev = a[0];
	for (int i = 1; i < n*m; i++) {
		if (a[i] == prev)
			cnt++;
		else {
			cnt = 1;
			prev = a[i];
		}
		if (cnt > (n*m) / 2) {
			break;
		}
	}
	printf("%d\n", prev);
	return 0;
}