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
#include<iostream> #include<map> using namespace std; typedef map<int, int>::iterator ITER; int main() { int M, N,input; map<int, int>mcount; ITER iter; cin >> M >> N; for (int i = 0; i < N; ++i) { for (int j = 0; j < M; ++j) { cin >> input; iter = mcount.find(input); if (iter == mcount.end()) { mcount.insert(make_pair(input,1)); } else { mcount[input] = iter->second + 1; } } } for (iter = mcount.begin(); iter != mcount.end(); ++iter) { if (iter->second > (M*N) / 2) { cout << iter->first; break; } } return 0; }
运行结果: