zoukankan      html  css  js  c++  java
  • PAT 1054. The Dominant Color

    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, 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.

    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

    分析
    很OK,开一个数组超限了,就用map了。

    #include<iostream>
    #include<map>
    using namespace std;
    int main(){
    	map<int,int> checked;
    	int m,n,t;
    	cin>>m>>n;
    	for(int i=0;i<m;i++)
    	   for(int j=0;j<n;j++){
    	   	   cin>>t;
    	   	   checked[t]++;
    	   	   if(checked[t]>m*n/2)
    	   	      cout<<t; 
    	   }
        return 0;
    } 
    
  • 相关阅读:
    GIT笔记
    C++新式类型转换
    C++ 静态链表基本算法实现
    C++ 顺序栈基本算法实现
    C++ 链栈 基本算法实现
    C++ 循环队列基本算法实现
    C++ 链队列基本算法实现
    C++优先级队列表基本算法实现
    C++单链表基本算法实现
    C++ 循环链表基本算法
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/8336126.html
Copyright © 2011-2022 走看看