题目链接:点这里!!!
题解:
我们直接求出两两之间的公共部分是多少,然后直接跑TSP就ok了,但是有个梗,我们要事先对字符串按长度排好序,尽可能去匹配长的,就可以了!!!!
给组数据:
/*
5
aaaaaaa
a
aa
aaa
aaaaab
*/
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<vector>
#include<bitset>
#include<set>
#include<queue>
#include<stack>
#include<map>
#include<cstdlib>
#include<cmath>
#define pb push_back
#define pa pair<int,int>
#define clr(a,b) memset(a,b,sizeof(a))
#define lson lr<<1,l,mid
#define rson lr<<1|1,mid+1,r
#define bug(x) printf("%d++++++++++++++++++++%d\n",x,x)
#define key_value ch[ch[root][1]][0]
#pragma comment(linker, "/STACK:102400000000,102400000000")
typedef long long LL;
const LL MOD = 1000000007;
const int N = 55;
const int maxn = 1e6+15;
const int letter = 130;
const int INF = 1e9;
const double pi=acos(-1.0);
const double eps=1e-10;
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n;
int mp[25][25],a[25];
int dp[1<<15][25];
struct node{
char s[25];
bool operator < (const node &p) const{
int n=strlen(s),m=strlen(p.s);
return n<m;
}
}p[25];
bool cmd(char a[],char b[]){
int n=strlen(a),m=strlen(b);
return n>m;
}
int check(char a[],char b[]){
int n=strlen(a),m=strlen(b);
int vs=0;
for(int i=0;i<n;i++){
if(a[i]==b[0]){
int l=i,flag=1,ans=0;
for(int j=0;j<m&&l<n;j++,l++,ans++){
if(b[j]!=a[l]){flag=0;break;}
}
if(l!=n) continue;
if(flag) {vs=ans;break;}
}
}
return vs;
}
int main(){
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%s",p[i].s);
sort(p,p+n);
int sum=0;
for(int i=0;i<n;i++) a[i]=strlen(p[i].s),sum+=a[i];
clr(mp,0);
for(int i=0;i<n;i++)
for(int j=0;j<n;j++){
if(i==j) continue;
mp[i][j]=check(p[i].s,p[j].s);
}
clr(dp,-1);
for(int i=0;i<n;i++) dp[(1<<i)][i]=0;
for(int x=0;x<(1<<n);x++){
for(int i=0;i<n;i++){
if(dp[x][i]==-1) continue;
for(int j=0;j<n;j++){
if((x&(1<<j))!=0) continue;
if(i==j) continue;
int p=x|(1<<j);
dp[p][j]=max(dp[p][j],dp[x][i]+mp[j][i]);
}
}
}
int max1=0;
for(int i=0;i<n;i++) {
max1=max(max1,dp[(1<<n)-1][i]);
}
printf("%d\n",sum-max1);
}
return 0;
}