1054. The Dominant Color (20)
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个数中超过一半的数,直接一个一个拼掉就好了,这个可以开到很大来卡内存和时间来着的。
#include<cmath> #include<vector> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; typedef long long LL; const int mod = 1e9 + 7; const int maxn = 2e5 + 10; int n, m, x, y, z; int main() { scanf("%d%d", &n, &m); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf("%d", &x); if (y == x) z++; else if (z) z--; else y = x, z = 1; } } printf("%d\n", y); return 0; }