PAT: 1054. The Dominant Color (20)

2014-11-24 11:03:06 · 作者: · 浏览: 0

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

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
AC代码:
//此题用map再适合不过了

#include
   
    
#include
     using namespace std; int main() { //freopen("in.txt","r",stdin); int m, n; map
     
       dc; map
      
       ::iterator it; //定义迭代器 while(scanf("%d %d",&m,&n)!=EOF) { int i, j, a; for(i=0; i
       
        second > n*m/2) { //A strictly dominant color takes more than half of the total area. printf("%d\n",it->first); break; } } } return 0; }