PAT甲级 A1054

PAT甲级 A1054

题目详情

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.

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
​24
​​ ). 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

解题思路

这道题用map来实现int一对一的存储并且在每次选取最大的数，可以减少冗余空间并提高效率
以下为AC代码

#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<memory.h>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<stack>
using namespace std;
map<int, int> ques;
int itoi(int a) {
	if (ques.find(a) == ques.cend()) {
		ques[a] = 0;
		return 0;
	}
	else {
		return ques[a];
	}
}
int main() {
	int N, M;
	cin >> N >> M;
	int max = 0; int maxno = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			int temp;
			scanf_s("%d", &temp);
			if (itoi(temp) == 0) {
				ques[temp] = 1;
			}
			else {
				ques[temp]++;
			}
			if (ques[temp] > max) {
				max = ques[temp];
				maxno = temp;
			}
		}
	}
	cout << maxno << '\n';
	
}