EASY_ZJU_PAT_Advanced Level_1046 寻找最多子串

1054. The Dominant Color (20)

时间限制

100 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

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.

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, 2²⁴). 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

迄今为止ZJU OJ中最简单的一道题，但是要主要不要用cin要用printf，要不然会超时的

#include<iostream>
#include<vector>
#include<algorithm>
#include<map>

using namespace std;
int main(){
	int M = 0, N = 0;
	cin>>M>>N;
	vector<int> colors;
	//map<int,int> colorsMap;
	for(int i = 0; i<M*N;i++){
		int color;
		scanf("%d",&color);
	//	colorsMap[color]++;
		colors.push_back(color);
	}
	
	sort(colors.begin(),colors.end());

	int continueNum = 1;		
	
	if(colors.size()==1){
		cout<<colors[0];
	}else{
		for(int cI = 0; cI<colors.size()-1; cI++){
			if(colors[cI]==colors[cI+1]){
				continueNum++;
				if(continueNum>=N*M*1.0/2){
					cout<<colors[cI]<<endl;
					break;
				}
			}else{
				continueNum=1;
			}
		}
	}
	

	return 0;
}