PAT甲级1054答案（使用C语言）

题目描述

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

这道题和A1041的思路类似可进行参考A1041AC代码

AC代码块

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

const M = 800;
const N = 600;
int m, n;
int res[M][N];
int flag[100000000];


int main(){
	fill(flag, flag + M*N, 0);
	scanf("%d%d", &m, &n);
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			scanf("%d", &res[i][j]);
			//printf("%d", res[i][j]);
			//flag[res[i][j]] += 1;
		}
	}

	for(int k = 0; k < n; k++){
		for(int l = 0; l < m; l++){
			flag[res[k][l]]++;
		}
	}
	
	int max_index = 0, max = flag[max_index];
	for(int g = 0; g < M * N; g++){
		if(flag[g] != 0){
		//	printf("%d ", flag[g]);
		}
		
		if(flag[g] > max){
			max = flag[g];
			max_index = g;
		}
	}
	printf("%d", max_index);
	
	return 0;
}