ds 9.1哈希

最新推荐文章于 2023-11-04 14:20:52 发布

_北鸣

最新推荐文章于 2023-11-04 14:20:52 发布

阅读量335

点赞数

分类专栏： ds课程题目文章标签：字符串哈希

本文链接：https://blog.csdn.net/MeJustOny/article/details/53457183

版权

ds课程题目专栏收录该内容

28 篇文章 1 订阅

订阅专栏

字符串哈希--参考博客

 
            /***************
Problem from :
Problem describe :
   字符串哈希的简单应用 
data:
****************/

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<cstring>
#include<vector>
#include<string>
#define ll __int64
#define inf 0x3f3f3f3f3f
using namespace std;

char c[1000005];
const int n =0x7FFFFFFF;
__int64 hash[120000]={0};
int getHash(int i, int j) // BKDR Hash Function
{
	int key = 7; // >=7的质数都比较好点 
	int h = 0;
	for(; i<j; i++)
	{
		h = h*key + c[i]-'a'+1;
	}
	return h;
}
int main()
{
//  freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
	int i, j, ans=0;
	int n, m, k;
	scanf("%d%d%d", &n, &m, &k);
	scanf("%s", c);
	int len = strlen(c);
	for(i=0; i<=len-k; i++)
	{
		int h = getHash(i, i+k);
		if(!hash[h]) ans++;
		hash[h] = 1;
	}
	printf("%d\n", ans);
	return 0;
}