很简单的一道字典树题目,只需要把字典树建立好后,遍历一遍得到结点个数x,然后答案就是2*x+n-最长单词的长度(先贪心想局部,再跳出来想全局,很容易就得到这个结论)。
代码如下:
#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <iomanip>
#include <cmath>
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define lrt rt << 1
#define rrt rt << 1|1
#define root 1,n,1
#define BitCount(x) __builtin_popcount(x)
#define BitCountll(x) __builtin_popcountll(x)
#define LeftPos(x) 32 - __builtin_clz(x) - 1
#define LeftPosll(x) 64 - __builtin_clzll(x) - 1
const double PI = acos(-1.0);
const int INF = 1e7;
using namespace std;
const double eps = 1e-5;
const int MAXN = 300 + 10;
const int MOD = 1000007;
const double M=1e-8;
const int N=100010;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
const int d[4][2]={{0,1},{0,-1},{-1,0},{1,0}};
int n,m,deep;
LL ans;
struct node
{
int cnt;
node *next[26];
node()
{
cnt=0;
MS(next,NULL);
}
};
class trie
{
public:
node *rt;
trie() { rt=new node; }
void insert(char s[])
{
node *p=rt;
int i=0;
while(s[i]) {
if (p->next[s[i]-'a']==NULL) p->next[s[i]-'a']=new node;
p=p->next[s[i]-'a'];
i++;
}
p->cnt++;
}
void dfs(node *p)
{
for (int i=0;i<26;i++) if (p->next[i]) {
dfs(p->next[i]);
delete p->next[i];
}
}
void del()
{
dfs(rt);
MS(rt->next,NULL);
}
};
void dfs(node *p,int deep)
{
ans+=2;
for (int i=0;i<26;i++) if (p->next[i]) {
dfs(p->next[i],deep+1);
}
}
trie t;
int main()
{
int i,j;
while(~scanf("%d",&n))
{
int mx=-INF;
char s[N];
for (i=0;i<n;i++) {
scanf("%s",s);
t.insert(s);
//int len=strlen(s);
mx=max(mx,(int)strlen(s));
}
ans=0;
for (int i=0;i<26;i++) if (t.rt->next[i]) {
dfs(t.rt->next[i],1);
}
cout<<ans+n-mx<<endl;
t.del();
}
}