POJ1200 Crazy Search

POJ1200 Crazy Search

题意：给定一个字符串，其中含有不同的字母数量为m，现在求这个字符串中有多少个长度为n且长的互不相同的字符子串

	字符串hash板子题，手动去重。这个题目卡了一下map和set 

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
typedef unsigned long long ull;
const int maxn = 2e6+1000;
ull base = 13331;
ull f[maxn],p[maxn];
vector<ull> s;
char str[maxn];
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    f[0] = 0;
    p[0] = 1;
    scanf("%s",str+1);
    int len = strlen(str+1);
    for(int i = 1; i <= len; ++i)
    {
        f[i] = f[i-1]*base+(str[i]-'a'+1);
        p[i] = p[i-1]*base;//
    }
    ull H;
    for(int i = 1; i+n-1 <= len; ++i)
    {
        H = f[i+n-1]-f[i-1]*p[n];
       s.push_back(H);
    }
    sort(s.begin(),s.end());
    int num = 1;
    for(int i = 0; i < s.size()-1; ++i)
        if(s[i] != s[i+1])
            num++;
    printf("%d\n",num);
    return 0;
}