码迷,mamicode.com
首页 > 其他好文 > 详细

1054. The Dominant Color (20)

时间:2015-12-06 12:49:00      阅读:126      评论:0      收藏:0      [点我收藏+]

标签:

挺简单的,多占内存,少用循环


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

 

  1. #pragma warning(disable:4996)
  2. #include <stdio.h>
  3. using namespace std;
  4. int a[16777216];
  5. int main(void) {
  6. int m, n;
  7. scanf("%d %d", &m, &n);
  8. int p = m*n,temp,count=0,result=0;
  9. for (int i = 0; i < p; i++) {
  10. scanf("%d", &temp);
  11. a[temp]++;
  12. if (a[temp] > count) {
  13. count = a[temp];
  14. result = temp;
  15. }
  16. }
  17. printf("%d", result);
  18. return 0;
  19. }





1054. The Dominant Color (20)

标签:

原文地址:http://www.cnblogs.com/zzandliz/p/5023178.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!