题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1247
题意:给出一些单词,输出所有的复合单词,复合单词是指由两个单词连接而成,而这两个单词也是给出范围内的。
思路:考虑用trie树去查找单词,先将所有单词都插入进去。对于一个单词是不是复合单词,枚举这个单词中间断开位置,在trie树中去查找前后两部分即可。
当然也可以用map直接搞一下。用map做可以参考这里,改一下数组大小可以直接用:http://blog.csdn.net/chy20142109/article/details/50650973
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,j,k) for(int i = j; i <= k; i++ )
#define Rrep(i,j,k) for(int i = j; i >= k; i-- )
#define Clean(x,y) memset(x,y,sizeof(x))
const int maxn = 50009;
char str[maxn][51];
struct trie
{
trie *next[26];
bool flag;
};
void init(trie *x)
{
rep(i,0,25) x->next[i] = NULL;
x->flag = false;
}
void insert(trie *x,char s[])
{
int k = 0;
while( s[k] )
{
int index = s[k] - 'a';
if ( x->next[index] == NULL )
{
x->next[index] = new trie;
init(x->next[index]);
}
x = x->next[index];
k++;
}
x->flag = true;
}
bool query( trie *x,char s[] )
{
int k = 0;
while( s[k] )
{
int index = s[k] - 'a';
if ( x->next[index] == NULL ) return false;
x = x->next[index];
k++;
}
return x->flag;
}
trie *T;
int main()
{
T = new trie;
init(T);
int n = 0;
while( gets( str[++n] ) ) insert(T,str[n]);
char temp;
bool can;
rep(i,1,n)
{
int len = strlen(str[i]);
rep(j,0,len-2)
{
can = true;
temp = str[i][j+1];
str[i][j+1] = '\0';
can &= query(T,str[i]);
str[i][j+1] = temp;
can &= query(T,&str[i][j+1]);
if ( can )
{
puts(str[i]);
break;
}
}
}
return 0;
}