1054. The Dominant Color (20) 简单智力题

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. 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:

24

题意：给定一堆数，让你求这一堆数中超过总数1/2的数

题解：简单的智力题,设置一个变量，并记录他的出现次数，出现新的数，如果和他相同，计数次数+1，否则-1。时间复杂度O（n）

#include <cstdio>

int main() {
    int n, m, x, cnt, tmp;
    cnt = 0;
    scanf("%d%d", &n, &m);
    n = n * m;
    while (n--) {
        scanf("%d", &tmp);
        if (cnt == 0) {
            x = tmp;
            cnt = 1;
        }
        else if (x == tmp)
            ++cnt;
        else
            --cnt;
    }
    printf("%d\n", x);
    return 0;
}