1054. The Dominant Color (20) 客官°小女子只卖身不卖艺 2022-05-31 13:23 99阅读 0赞 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 -------------------- 题目大意: 代码: #include<stdio.h> #include<map> using namespace std; map<int,int> Map; int main() { int i,j,n,m,k,t,num,result; scanf("%d %d",&n,&m); t=n*m/2; num=-1; result=-1; for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%d",&k); Map[k]++; if(num<Map[k]) { num=Map[k]; result=k; } } } printf("%d\n",k); return 0; }
还没有评论,来说两句吧...