1054 The Dominant Color (20)（20 point(s)）

1054 The Dominant Color (20)（20 point(s)）

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^24^). 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:

24

思路 ，既然最优势颜色是超过整个像素一半的数量，所以就用 1：1 对消的思路，优势颜色和非优势颜色抵消，最后剩下的就是优势颜色。

code

#include <iostream>
#include <map>
#include <stdio.h>
using namespace std;
int main(){
	int m, n, x;
	scanf("%d %d", &m, &n);
	int colornum = 0, color = 0;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < m; ++j) {
			scanf("%d ", &x);
			if (colornum == 0) {
				color = x;
			}
			if (color == x) {
				colornum++;
			}
			else {
				colornum--;
			}
		}
	}
	printf("%d", color);
	system("pause");
	return 0;
}