摘要: banana band bee absolute acm ba b band abc#includeusing namespace std;//数据结构struct Treenode{ int count; Treenode *next[26]; Treenode(){ count=1; for(int i=0;inext[branch]) location->next[branch]->count++; else loca... 阅读全文
posted @ 2013-09-19 15:02 一枚程序员 阅读(341) 评论(0) 推荐(0) 编辑