POJ - 2001 Shortest Prefixes从（字典树）

POJ - 2001 Shortest Prefixes从（字典树）

A prefix of a string is a substring starting at the beginning of the given string. The prefixes of “carbon” are: “c”, “ca”, “car”, “carb”, “carbo”, and “carbon”. Note that the empty string is not considered a prefix in this problem, but every non-empty string is considered to be a prefix of itself. In everyday language, we tend to abbreviate words by prefixes. For example, “carbohydrate” is commonly abbreviated by “carb”. In this problem, given a set of words, you will find for each word the shortest prefix that uniquely identifies the word it represents.

In the sample input below, “carbohydrate” can be abbreviated to “carboh”, but it cannot be abbreviated to “carbo” (or anything shorter) because there are other words in the list that begin with “carbo”.

An exact match will override a prefix match. For example, the prefix “car” matches the given word “car” exactly. Therefore, it is understood without ambiguity that “car” is an abbreviation for “car” , not for “carriage” or any of the other words in the list that begins with “car”.
Input
The input contains at least two, but no more than 1000 lines. Each line contains one word consisting of 1 to 20 lower case letters.
Output
The output contains the same number of lines as the input. Each line of the output contains the word from the corresponding line of the input, followed by one blank space, and the shortest prefix that uniquely (without ambiguity) identifies this word.
Sample Input
carbohydrate
cart
carburetor
caramel
caribou
carbonic
cartilage
carbon
carriage
carton
car
carbonate
Sample
Output
carbohydrate carboh
cart cart
carburetor carbu
caramel cara
caribou cari
carbonic carboni
cartilage carti
carbon carbon
carriage carr
carton carto
car car
carbonate carbona

题目大意：

给你一些字符串，让你输出每个能表示这个字符串的子串（从头开始的）。

解题思路：

用一个sum数组记录下每个节点经过的次数。
然后我们把所有的单词都add了之后开始 查每个单词。一直到这个sum[]==1的位置，就说明，没有其他的单词到过这个位置，所以这个位置之前的部分就能唯一标识这个单词。

AC代码：

#include <iostream>
#include <cstring>
#include <cstdio> 
using namespace std;
const int maxn = 2e6+10;
int tree[maxn][30];//30取决于字母的个数,第i个节点的第j个孩子
int tot = 0;
int sum[maxn];
char ss[maxn][30];
bool flag[maxn];//标号为i的是否为一个字符串的最后一个
void add(char *s){
	int root = 0;
	int id;
	int len = strlen(s);
	for(int i=0;i<len;i++){
		id = s[i]-'a';//这个字母是几
		if(!tree[root][id]) tree[root][id] = ++tot;
		root = tree[root][id];
		sum[root]++;
	}
	flag[root] = true;//这是个字符串
}

string find(char *s){
	int root = 0;
	int id;
	string ans = "";
	int len = strlen(s);
	for(int i=0;i<len;i++){
		id = s[i]-'a';
		ans += s[i]; 
		root = tree[root][id];
		if(sum[root]==1){
			return ans;
		}
	}
}
int main(){
	int cnt = 0;
	while(scanf("%s",ss[cnt++])!=EOF){
		add(ss[cnt-1]);
	}
	for(int i=0;i<cnt;i++){
		cout<<ss[i]<<" "<<find(ss[i])<<endl;//输出结果
	}
	return 0;
}