1054. The Dominant Color (20)

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 <vector>
using namespace std;
int main()
{
int m,n;
cin>>m>>n;
vector<int> image(m*n);
for(int i=0;i<n*m;i++)
{
cin>>image[i];
}
int candidate=-1,count=0;
for(int i=0;i<m*n;i++)
{
if(count == 0)
{
candidate=image[i];
count++;
}
else
{
if(candidate != image[i])
count--;
else
count++;
}
}
cout<<candidate<<endl;
return 0;
}