Pat 1054 the dominiant color (20 points)

408 Optimal solution Spatial complexity O（1）

#include <iostream>
using namespace std;
int main() {
    
    long long temp,major=-1;
    int m,n,cnt=0;
    cin>>m>>n;
    for(int i=0;i<n;i++){
    
        for(int j=0;j<m;j++){
    
            cin>>temp;
            if(temp!=major){
    
                cnt--;
                if(cnt<=0){
    
                    major=temp;
                    cnt=1;
                }
            }else cnt++;
        }
    }
    cout<<major;
    return 0;
}

STL in map The answer is ⽤～ send ⽤arr[i] = j Express i The element appears in the matrix j Time , Losing ⼊ At the same time ⽐ a arr The current value
Whether more than half , If exceeded , Just output the number and exit the program

#include <iostream>
#include <map>
using namespace std;
int main() {
    
    int m, n;
    scanf("%d %d", &m, &n);
    map<int, int> arr;
    int half = m * n / 2;
    for(int i = 0; i < n; i++) {
    
        for(int j = 0; j < m; j++) {
    
            int temp;
            scanf("%d", &temp);
            arr[temp]++;
            if(arr[temp] > half) {
    
                printf("%d", temp);
                return 0;
            }
        }
    }
    return 0;
}