SDUT 1480 数据结构试验： 哈希表

　　取余，邻接表。

　　

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>

using namespace std;

struct N
{
    int data,ans;
    N *next;
}*hash[2000001] = {NULL};

int Max = 0,Max_num;

N *creat()
{
    N *p = (N *)malloc(sizeof(N));
    p->next = NULL;
    return p;
}

void insert(int OriginalNum,int Num)
{
    N *p,*q;
    if(hash[Num] == NULL)
    {
        hash[Num] = creat();
    }

    for(p = hash[Num]; p->next != NULL && OriginalNum < p->next->data; p = p->next)
        ;
    if(p->next == NULL || OriginalNum < p->next->data)
    {
        q = creat();
        q->ans = 1;
        q->data = OriginalNum;
        if(q->ans > Max)
        {
            Max = p->ans;
            Max_num = OriginalNum;
        }
        q->next = p->next;
        p->next = q;
    }
    else
    {
        p = p->next;
        if(p->ans > Max)
        {
            Max = p->ans;
            Max_num = OriginalNum;
        }
    }
}

int main()
{
    int n,a;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&a);
        if(a > 2000000)
        {
            insert(a,a%2000000);
        }
        else
        {
            insert(a,a);
        }
    }
    printf("%d\n",Max_num);
    return 0;
}