PAT 甲级 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, 800×600), you are supposed to point out the strictly dominant color.

输入

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,2^{2}4)$. It is guaranteed that the strictly dominant color exists for each input image. All the numbers in a line are separated by a space.

输出

For each test case, simply print the dominant color in a line.

思路

找主元素，就是一半以上的的都是由这个数字出现。我们可以想一下，最少的情况，每隔一个其他数字就出现该数字，若大于一半，则必须存在最后有连续的两个。若其他数字连续出现n次，则主元素就要连续出现n+1次。因此我们只需要遍历一遍看连续出现最多的数字即为主元素。

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
using namespace std;
long long graph[500000];
int main()
{
   int M, N;
   cin >> M>>N;
   for (int i = 0; i < M * N; i++)
   {
   	cin >> graph[i];
   }
   long long color = graph[0];
   int maxx = 1;
   int ci = 1;
   for (int i = 1; i < M * N; i++)
   {
   	if (graph[i] != graph[i - 1])
   	{
   		if (ci > maxx)
   		{
   			maxx = ci;
   			color = graph[i - 1];
   		}
   		ci = 1;
   	}
   	else
   	{
   		ci++;
   	}
   }
   if (ci > maxx)
   {
   	maxx = ci;
   	color = graph[M*N-1];
   }
   printf("%lld\n", color);
}