hdu_1029_hash/map

http://acm.hdu.edu.cn/showproblem.php?pid=1029

太水了，一次过，直接上代码吧，只想说最愚蠢的hash都要比map快！

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
using namespace std;
const int MAX = 999999*2;
const int MOD = 1000007;
int cnt[MAX];
int num[MAX];
void ha(int tm)
{
    int tt = tm%MOD;
    while(num[tt]!=-1) {
        if(num[tt]==tm) break;
        tt++;
    }
    num[tt] = tm;
    cnt[tt]++;
}
int main()
{
    int N;
    while(~scanf("%d",&N))
    {
        memset(num,-1,sizeof(num));
        memset(cnt,0,sizeof(cnt));
        int tm;
        while(N--){
            scanf("%d",&tm);
            ha(tm);
        }
        int m = 0;
        int u = -1;
        for(int i = 0; i < MAX; i++){
            if(cnt[i]>m) {u = i;m = cnt[i];}
        }
        printf("%d
",num[u]);
    }
    return 0;
}