HDOJ3460 Ancient Printer ---- 字典树

Problem Description

The contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper.
Unfortunately, what iSea could find was only an ancient printer: so ancient that you can't believe it, it only had three kinds of operations:

● 'a'-'z': twenty-six letters you can type
● 'Del': delete the last letter if it exists
● 'Print': print the word you have typed in the printer

The printer was empty in the beginning, iSea must use the three operations to print all the teams' name, not necessarily in the order in the input. Each time, he can type letters at the end of printer, or delete the last letter, or print the current word. After printing, the letters are stilling in the printer, you may delete some letters to print the next one, but you needn't delete the last word's letters.
iSea wanted to minimize the total number of operations, help him, please.

Input

There are several test cases in the input.

Each test case begin with one integer N (1 ≤ N ≤ 10000), indicating the number of team names.
Then N strings follow, each string only contains lowercases, not empty, and its length is no more than 50.

The input terminates by end of file marker.

Output

For each test case, output one integer, indicating minimum number of operations.

Sample Input




Sample Output




21

Hint

The sample's operation is: f-r-e-e-o-p-e-n-Print-Del-Del-Del-Del-r-a-d-i-a-n-t-Print

输入n个字符串，打印机只能进行如下3种操作：

①在缓冲区末尾增加一个字符

②在缓冲区末尾删除一个字符

③打印出缓冲区内容

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
char input[55];
int cnt = 0; // 节点个数
int n;
int maxLen = 0;
struct Node {
char ch;
Node *next[26];// 子节点
Node(char c){
for(int i = 0;i < 26;i++) next[i] = NULL;
ch = c;
}
~Node() {
for(int i = 0;i < 26;i++) {
if(next[i] != NULL)	delete next[i];
}
}
} *root;
// 建树
void Build() {
int len = strlen(input);
maxLen = max(maxLen,len);
Node *cur = root;
int index = 0;
while(cur && (index < len)) {
if(cur->next[input[index]-'a'] == NULL) {
cur->next[input[index]-'a'] = new Node(input[index]);
cnt++;
cur = cur->next[input[index]-'a'];
index++;
} else {
cur = cur->next[input[index]-'a'];
index++;
}
}
}

int main()
{
while(scanf("%d",&n) != EOF) {
root = new Node('a');// 任意赋值
cnt = 0;
maxLen = 0;
for(int i = 0;i < n;i++) {
scanf("%s",input);
Build();
}
printf("%d\n",2*cnt - maxLen + n);
delete root;
}
return 0;
} 

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120