1054The Dominant Color (20)

最新推荐文章于 2022-11-16 22:18:30 发布

原创最新推荐文章于 2022-11-16 22:18:30 发布 · 191 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个算法，用于从给定分辨率的图像中找出占据超过一半面积的严格主导颜色。该算法通过遍历每个像素并计数每种颜色出现的次数来实现。

题目描述

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.

输入描述:

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, 224).  It is guaranteed that the strictly dominant color exists for each input image.  All the numbers in a line are separated by a space.

输出描述:

For each test case, simply print the dominant color in a line.

输入例子:

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

输出例子:

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

int main() {
int m, n; //n是行数，m是每行的颜色
int x;
cin >> m >> n;
map<int, int> temp;
for (int i = 0; i < n * m; i++) {
cin >> x;
temp[x]++;
if (temp[x] >= m * n / 2) {
cout << x;
return 0;
}
}
return 0;
}