1054. The Dominant Color (20)
时间限制100 ms
内存限制65536 kB
代码长度限制16000 B
判题程序Standard作者CHEN, Yue
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 24Sample Output:24像素N*M
接着给出N*M 的颜色bit
求占主要的颜色;
英语不是很懂,看了别人的代码,应该就是求颜色占一半以上的那种色彩。和以前的题目几乎一样,但少了判断是否有符合条件的颜色
联动以前的vote 投票 http://xujiayu317.blog.163.com/blog/static/25475209201496114347448/
评测结果
时间 | 结果 | 得分 | 题目 | 语言 | 用时(ms) | 内存(kB) | 用户 |
---|---|---|---|---|---|---|---|
8月12日 19:39 | 答案正确 | 20 | 1054 | C++ (g++ 4.7.2) | 95 | 308 | datrilla |
测试点
测试点 | 结果 | 用时(ms) | 内存(kB) | 得分/满分 |
---|---|---|---|---|
0 | 答案正确 | 1 | 300 | 12/12 |
1 | 答案正确 | 1 | 308 | 2/2 |
2 | 答案正确 | 95 | 284 | 2/2 |
3 | 答案正确 | 6 | 308 | 2/2 |
4 | 答案正确 | 1 | 180 | 2/2 |
#include<iostream> using namespace std; int main() { int Nx, My,index,color,dominant; cin >> Nx >> My; Nx = Nx*My - 1; cin >> dominant; My = 0; while (Nx--) { cin >> color; if (color == dominant) My++; else if (My==0) dominant = color; else My--; } cout << dominant << endl; system("pause"); return 0; }