BZOJ 2251: [2010Beijing Wc]外星联络 Trie树
这道题本来以为时后缀数组,后来注意到单词不长,那就可以直接用Trie树了,记录一下每个点经过的次数,最后扫一遍Trie树就行了#include<cstdio>#include<cstdlib>#include<ctime>#include<cmath>#include<cstring>#include<string>#include<iostream>#include<iomanip>
原创
2016-12-28 19:28:44 ·
326 阅读 ·
0 评论