The Dominant Color (20)

時間限制 1000 ms 記憶體限制 65536 KB 程式碼長度限制 100 KB 判斷程式 Standard (來自 小小)

題目描述

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.

輸入描述:

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.

輸出描述:

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

輸入例子:

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

輸出例子:

24

兩種方法，第一種用時會少一些。

#include<stdio.h>
int main()
{
	
	int n,m,i,j,p,ans,cnt;
	scanf("%d%d",&m,&n);
	ans=p=cnt=0;
	for(i=0;i<m;i++)
	{
		for(j=0;j<n;j++)
		{
			scanf("%d",&p);
			if(cnt==0)
			{
				ans=p;
				cnt++;
			}
			else if(ans!=p)
			  cnt--;
			else
			  cnt++;
		}
	}
	printf("%d\n",ans);
	return 0;
}
 

#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
	int m,n,i,j,p;
	vector<int>v;
	scanf("%d%d",&m,&n);
	for(i=0;i<m;i++)
	{
		for(j=0;j<n;j++)
		{
			scanf("%d",&p);
			v.push_back(p);
		}
	}
	sort(v.begin(),v.end());
	printf("%d\n",v[v.size()/2]);
	return 0;
 }