Description: Set Σ = [α1, α2 ... ... αn] are n个separate symbols symbol set. Lk = [β1β2 ... βk | βiЄ Σ, 1 ≤ i ≤ k] Σ Medium characters are composed of all k length strings. S a subset of Lk are, S are non-Lk separator dictionary refers to the arbitrary element S Medium a1a2 ... ak, b1b2 ... bk. [A2a3 ... akb1, a3a4 ... akb1b2, ... ..., akb1b2 ... bk-1] ∩ S = Φ. The algorithm algorithm, for a given positive integer n and k, calculated Lk largest free dictionary separator.
File list (Check if you may need any files):
dict.cpp
Download