PAT 1054. The Dominant Color (20)

1054. The Dominant Color (20)

时间限制

100 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

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

#include<stdio.h>

const int MAX = 490000;//必须要const，题中告诉800*600
int a[MAX]={0}; //初始化


int main()
{
int m,n,mn;
int i,j,x;
//freopen("D:\\input.txt","r",stdin);


scanf("%d%d",&m,&n);
mn = m * n;
for(i = 0; i < mn; i++){
scanf("%d",&a[i]);
}
int candidate, cnt=0;
for(i = 0; i < mn; i++)
        {
if(cnt == 0)
                {
candidate = a[i];
cnt = 1;
} 
                else 
                {
if(candidate == a[i])
cnt++;
else
cnt--;
}
}
printf("%d",candidate);
return 0;

}