1054. The Dominant Color (20)
2015-07-23 13:17
295 查看
题目如下:
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:
Sample Output:
题目要求从一个线性表中找出出现次数最多的元素,可以使用map统计每个元素的出现次数,然后动态的统计当前出现次数最多的。
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
题目要求从一个线性表中找出出现次数最多的元素,可以使用map统计每个元素的出现次数,然后动态的统计当前出现次数最多的。
#include <iostream> #include <map> #include <stdio.h> using namespace std; int main() { int maxCnt = -1; int maxColor = -1; map<int,int> colorMap; int M,N; cin >> M >> N; int color; for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ scanf("%d",&color); if(colorMap.find(color) == colorMap.end()){ colorMap[color] = 1; }else{ colorMap[color]++; } if(maxCnt < colorMap[color]){ maxCnt = colorMap[color]; maxColor = color; } } } cout << maxColor << endl; return 0; }
相关文章推荐
- iGrimaceV3.0电脑安装教程
- "真实"和"谎言"
- 1054. The Dominant Color (20)
- 为tomcat设置基于主机名的虚拟主机并使其能在本机上运行的步骤
- 使用WITH AS提高性能简化嵌套SQL
- 谷歌说使用新顶级域名不会影响排名
- Android 删除再创建导致open failed: EBUSY (Device or resource busy)
- 哈希算法快速查表的原理
- 局域网内通过ip获取对方计算机名
- Git操作的一些注意
- css去掉iPhone、iPad默认按钮样式
- NanoMsg-0.6beta编译
- 关于SlidingMenu的使用
- 一个人的旅行(最短路+离散化)
- 抽象类和接口
- Xcode - 修改本地路径
- 更改远程桌面端口
- MSSQL 的with ties 关键字
- sort排序
- Java中如何遍历Map对象的4种方法