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.
#include <stdio.h>
#include <stdlib.h>
#include <map>
using namespace std;
int main ()
{
map<int,int> mp;
int i,j,m,n,temp;
scanf("%d %d",&m,&n);
for( i=0;i<n;i++)
{
for( j=0;j<m;j++)
{
scanf("%d",&temp);
if( mp.find(temp)!=mp.end()) mp[temp]++;
else mp[temp]=1;
}
}
int k=m*n/2;
for( map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
{
if( it->second>k)
{
printf("%d\n",it->second);
return 0;
}
}
system("pause");
return 0;
}
原文地址:http://blog.csdn.net/lchinam/article/details/44100429