POJ1200 Crazy Search

题目描述

Description

Many people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime number in a given text. Such number could be the number of different substrings of a given size that exist in the text. As you soon will discover, you really need the help of a computer and a good algorithm to solve such a puzzle.
Your task is to write a program that given the size, N, of the substring, the number of different characters that may occur in the text, NC, and the text itself, determines the number of different substrings of size N that appear in the text.

As an example, consider N=3, NC=4 and the text "daababac". The different substrings of size 3 that can be found in this text are: "daa"; "aab"; "aba"; "bab"; "bac". Therefore, the answer should be 5.

Input

The first line of input consists of two numbers, N and NC, separated by exactly one space. This is followed by the text where the search takes place. You may assume that the maximum number of substrings formed by the possible set of characters does not exceed 16 Millions.

Output

The program should output just an integer corresponding to the number of different substrings of size N found in the given text.

Sample Input

3 4
daababac

Sample Output

5

解题思路

Hash字符串 

Rabin-Karp   如 字符串 “acm” 可对应 0*26^2 + 2*26 + 12

保证所有字符串的Hash值是不同的

转载方法一

时间复杂度为O(strlen(s)*n)

#include<stdlib.h>    
#include<memory.h>   
#include<stdio.h>   
#include<iostream>   
using namespace std;   
#define MAX 20000000  


//这题将字符串转换为一个nc进制的数,判断这个   
//数是否重复出现即可   
bool c[MAX];   
char x[MAX];   
//将字母转换为对应的数字,因为字母可能不是连续的   
//如nc = 3时可能会有aeccc这种字符串   
//处理后a,c,e分别代表0,1,2   
int ascii[256];   

int main()   
{   
    int n,nc;   
    while(scanf("%d%d/n",&n,&nc)!=EOF)   
    {   
        memset(c,0,sizeof(c));   
        memset(ascii,0,sizeof(ascii));   
        int tmp,res(0);   
        scanf("%s",x);   
        int len = strlen(x);   
        
        //将出现过的字母都标记为-1(true)   
        for(int i = 0; i < len; i++)   
            ascii[x[i]] = -1;   
        int zz = 0;   
        //为出现过的字母分配数字   
        for(int i = 0; i < 256; i++)   
            if(ascii[i])   
                ascii[i] = zz++;   
       
        bool flag;   
        len = len - n + 1;   
        for(int i = 0; i < len; i++) {   
            flag = true;   
            tmp = 0;   
            //将子字符串转换为nc进制数   
            for(int j = 0; j < n; j++)   
                tmp = tmp*nc + ascii[x[i+j]];   
            tmp = abs(tmp)%MAX;   
            if(!c[tmp]){   
                res++;   
                c[tmp] = true;   
            }   
        }   
        printf("%d/n",res);   
    }   
    return 0;   
}  


本文来自CSDN博客，转载请标明出处：http://blog.csdn.net/suikay/archive/2009/03/30/4036061.aspx
 

改进，算子串subString，让其时间复杂度为O(1) 

总的时间复杂度为O(strlen(s))

#include<stdlib.h>    
#include<memory.h>   
#include<stdio.h>   
#include<iostream>   
using namespace std;   
#define MAX 20000000  


//这题将字符串转换为一个nc进制的数,判断这个   
//数是否重复出现即可   
bool c[MAX];   
char x[MAX];  
int ascii[256];  
//将字母转换为对应的数字,因为字母可能不是连续的   
//如nc = 3时可能会有aeccc这种字符串   
//处理后a,c,e分别代表0,1,2   
  

int main()   
{   
    int n,nc;   
    while(scanf("%d%d/n",&n,&nc)!=EOF)   
    {   
        memset(c,0,sizeof(c));   
        memset(ascii,0,sizeof(ascii));   
        int tmp,res(0);   
        scanf("%s",x);   
        int len = strlen(x);   
        
        //将出现过的字母都标记为-1(true)   
        for(int i = 0; i < len; i++)   
            ascii[x[i]] = -1;   
        int zz = 0;   
        //为出现过的字母分配数字   
        for(int i = 0; i < 256; i++)   
            if(ascii[i])   
                ascii[i] = zz++;   

        //统计第一个长度为n的substring的HashValue存为sum 
        int sum = 0;
        for(int i=0; i<n; i++)
        {
            sum *= nc;
            sum += ascii[x[i]]; 
        } 
        
        int res = 0; //存储结果 
        if(!c[sum])
        {
            c[sum] = true;
            res++;
        }  
        int pow = 1;
        for(int i=0; i<n-1; i++)
            pow *= nc;
            
        //以后每次算subString，用上一个subString的hashValue直接用公式计算一下即可，时间复杂度为O(n) 
        for(int i = n; i < len; i++) {   
            sum -= ascii[x[i-n]]*pow;
            sum *= nc;
            sum += ascii[x[i]];
            if(!c[sum])
            {
                res++;
                c[sum] = true;
            }
        }   
        printf("%d/n",res);   
    }   
    return 0;   
}