关闭

PAT-PAT (Advanced Level) Practise The Dominant Color (20) (map计数)【二星级】

标签: PAT入门
278人阅读 评论(0) 收藏 举报
分类:

题目链接:http://www.patest.cn/contests/pat-a-practise/1054


题面:

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, 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
题目大意:

   数出现最多的数。


解题:

   区间范围较大,用map计数。


代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
#include <string>
#include <map> 
using namespace std;
#define LL long long 
map <int,int> cnt;
int main()
{
	int n,m,tmp,maxx,p;
	scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
    	for(int j=1;j<=m;j++)
    	{
		  scanf("%d",&tmp);
    	  cnt[tmp]++;
    	}
    }
    map <int,int> ::iterator it;
    maxx=0;
    for(it=cnt.begin();it!=cnt.end();it++)
    {
    	if(it->second>maxx)
    	{
	    	maxx=it->second;
			p=it->first; 
	    }
    }
    cout<<p<<endl;
	return 0;
} 


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:206340次
    • 积分:5320
    • 等级:
    • 排名:第5067名
    • 原创:318篇
    • 转载:9篇
    • 译文:0篇
    • 评论:42条
    博客专栏