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 24Sample Output:
24
这道题就是求二维数组中出现次数最多的数。一开始简单的用map来实现,但第三个case会超时。然后试一下用unordered_map,成功完全通过了...一次。第二次提交还是跪了。然后发现是Map[a]++之后,又取Map[a]来比较大小,这样相当于查找两次,比较耗时间,改为用一个值b保存好++Map[a]的值,然后用b进行比较进行了。
代码:
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <map>
//#include <boost/unordered_map.hpp>
#include <unordered_map>
using namespace std;
//using namespace boost;
int main()
{
int n,m;
scanf("%d %d",&n,&m);
unordered_map<int,int>Map;
int Max=0,res;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
int a;
scanf("%d",&a);
int b=++Map[a];
if(b>Max)
{
Max=b;
res=a;
}
}
}
printf("%d",res);
}