【字符串hash】 HDOJ 4821 String

题目就是求m*l的字符串且这个字符串中m个l都不相同的字符串个数。。。。刚开始TLE。。换了种姿势就行了。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 40005
//#define eps 1e-10
#define mod 1000000007
#define INF 1e9
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
//head

const int x = 123;
char s[maxn];
ULL hash[maxn], xp[maxn];
set<ULL> ss;
ULL q[maxn];
int pre[maxn];
int n, m;

inline ULL H(int now, int L, char *t)
{
    return hash[now] - hash[now + L] * xp[L];
}

void work(void)
{
    int len = strlen(s);
    xp[0] = 1, hash[len] = 0;
    for(int i = 1; i <= len; i++) xp[i] = xp[i-1] * x;
    for(int i = len - 1; i >= 0; i--) hash[i] = hash[i+1] * x + s[i] - 'a';
    int ans = 0, f, r, size;
	for(int i = 0; i < m; i++) {
		ss.clear();
		f = r = 0;
		size = 0;
		for(int j = i; j + m - 1 < len; j += m) {
			ULL t = H(j, m, s);
			if(ss.find(t) == ss.end()) ss.insert(t), size++, q[f++] = t;
			else {
				while(q[r] != t) size--, ss.erase(q[r++]);
				size--, ss.erase(q[r++]);
				ss.insert(t), size++, q[f++] = t;
			}
			if(size == n) {
				ans++;
				size--, ss.erase(q[r++]);
			}
		}
	}
    printf("%d\n", ans);
}

int main(void)
{
    while(scanf("%d%d%s", &n, &m, s)!=EOF) work();
    return 0;
}