【第22期】观点:IT 行业加班,到底有没有价值?

1054 The Dominant Color

原创 2015年11月21日 16:21:11

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

水题,水题,绝逼大水题。本来怕容量太大的,结果。。一点问题都没有。

#include<iostream>
#include<map>
#include<stdio.h>
using namespace std;
int main(){
	for(int n,m;scanf("%d%d",&n,&m)!=EOF;){
		map<int,int>sence;
		for(int i = 0;i < n; i++){
			for(int j = 0;j < m;j++){
				int temp;
				scanf("%d",&temp);
				sence[temp]++;
			}
		}
		map<int,int>::iterator iter ;
		int max = 0;
		int max_num = 0;
		for(iter = sence.begin();iter != sence.end();iter++){
			if(iter->second > max){
				max = iter->second;
				max_num = iter->first;
			}
		}
		printf("%d\n",max_num);
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

PAT甲级练习1054. The Dominant Color (20)

1054. The Dominant Color (20) 时间限制 100 ms 内存限制 65536 kB 代码长度限制 160...

【二分图+最小覆盖+简单题】杭电 hdu 1054 Strategic Game

/* THE PROGRAM IS MADE BY PYY */ /*----------------------------------------------------------------------------// Copyright (c) 2011 panyanyany Al...

程序员升职加薪指南!还缺一个“证”!

CSDN出品,立即查看!

【PAT】【Advanced Level】1054. The Dominant Color (20)

基础题

hdu1054 Strategic Game

这题的时间其实没必要10000ms,o(n)的复杂度就行了,算是dp吧,每次从叶节点往上更新就是,附上代码 #include&lt;stdio.h&gt; #include&lt;string.h&gt; int lcy[1510],fa[1510],son[...

PAT 1054. The Dominant Color (20)

http://pat.zju.edu.cn/contests/pat-a-practise/1054 Behind the scenes in the computer's memory...
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)