【哈希】 整数哈希 除数取余法 poj3274

题目来源：poj 3274

这个题处理的数据范围比较大，所以用一般的循环查找肯定是超时，所以就要往哈希表上想，先判断其关键字，让后根据关键字来缩小范围继续进行查找，这样可以省不少时间。

#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
using namespace std;
const int maxn = 100010;
const int maxk = 32;
int sum[maxn][maxk]; //第 1 头牛到第 i 头的对应属性的和
const int prime = 14997;
vector<int> hashLink[prime];
int n, k; //牛的数目

//判断两头牛对应的属性是否相等
bool cmp(int a, int b)
{
    for (int i = 0; i < k; i++)
    {
        if (sum[a][i] != sum[b][i])
        {
            return false;
        }
    }
    return true;
}

//求出距最远的平衡序列
int check()
{
    int maxLen = 0;
    for (int i = 0; i < prime; i++)
    {
        for (int j = 0; j < hashLink[i].size(); i++)
        {
            for (int q = j + 1; q < hashLink[i].size(); q++)
            {
                if (cmp(hashLink[i][j], hashLink[i][q]))
                {
                    int res = abs(hashLink[i][j] - hashLink[i][q]);
                    maxLen = max(maxLen, res);
                }
            }
        }
    }
    return maxLen;
}
int main()
{
    scanf("%d %d", &n, &k);
    int x;
    //处理输入变为二进制
    memset(sum, 0, sizeof(sum));
    for (int i = 1; i <= n; i++)
    {
        cin >> x;
        int col = 0;
        do
        {
            sum[i][col++] = x % 2;
            x /= 2;
        } while (x != 0);
    }

    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            sum[i][j] += sum[i - 1][j];
        }
    }
    for (int i = 0; i <= n; i++)
    {
        int original = 0;
        int sub = sum[i][k - 1];
        for (int j = 0; j < k; j++)
        {
            sum[i][j] -= sub;
            original += sum[i][j];
        }
        hashLink[(abs)(original % prime)].push_back(i);
    }
    cout << check() << endl;
    return 0;
}

WA…