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 30 0 255 16777215 2424 24 0 0 2424 0 24 24 24

Sample Output:

24

 

/*当count为0时重置buff，若读取到非buff值，count减1反之count加1，如此扫描下来buff中残余的必然是主颜色。*/#include <stdio.h>int main(){int M,N;int buff,count=0,temp;int i,j;scanf("%d%d",&M,&N);for(i=0;i<N;i++){for(j=0;j<M;j++){scanf("%d",&temp);if(count == 0){buff = temp;count++;}else{if(buff != temp){count--;}else{count++;}}}}printf("%d\n",buff);return 0;}

最为神奇的是，以下代码也可以过。

测试用例取的不好。

#include <stdio.h>int main(){int M,N;int temp;int i,j;scanf("%d%d",&M,&N);for(i=0;i<N;i++){for(j=0;j<M;j++){scanf("%d",&temp);}}printf("%d\n",temp);return 0;}