poj 1200 Crazy Search

Crazy Search

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 28083		Accepted: 7829

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

解法：把给出的nc个字符按原顺序编号1~nc，暴力枚举每个的子串，由于开始编号，每个不同的子串都有唯一编码。

const
  maxn=10000007;

var
  a:array[0..maxn] of integer;
  b:array['a'..'z'] of integer;
  i,j,n,m,ans:longint;
  p:longint;
  s:ansistring;

begin
  readln(n,m);
  readln(s);
  j:=0;
  for i:=1 to length(s) do
    begin
      if b[s[i]]=0 then begin inc(j);b[s[i]]:=j;end;
      if j=m then break;
    end;
  for i:=1 to length(s)-n+1 do
    begin
      p:=0;
      for j:=i to i+n-1 do
        p:=p*m+b[s[j]]-1;
      if a[p]<>1 then begin inc(ans);a[p]:=1;end;
    end;
  writeln(ans);
end.