POJ-1699-Best Sequence

字符串合并，dfs剪枝

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int MAX = 1e5+10;
const int mod = 1e9+7;
int n, t, ans;
char s[20 ][205];
int len[20];
int Merge[20][20];
bool vis[20];
void add(int x, int y)
{
    int l = 0;
    for(int i = 1; i<=len[x]&&i<=len[y]; ++i)
    {
        int flag = 1;
        for(int j = 0, k = len[x]-i; j<len[y]&&k<len[x]; ++j, ++k)
            if(s[x][k]!=s[y][j])
            {
                flag = 0;
                break;
            }
        if(flag)l = i;
    }
    Merge[x][y] = len[y]-l;
}
void dfs(int x, int num, int lenn)
{
    if(lenn>=ans)return;
    if(num==n)
    {
        ans = min(ans, lenn);
        return;
    }
    for(int i = 0; i<n; ++i)
    {
        if(!vis[i])
        {
            vis[i] = 1;
            dfs(i, num+1, lenn+Merge[x][i]);
            vis[i] = 0;
        }
    }
}
int main()
{
    scanf("%d", &t);
    while(t--)
    {
        memset(vis, 0, sizeof(vis));
        scanf("%d", &n);
        for(int i = 0; i<n; ++i)
        {
            cin>>s[i];
            len[i] = strlen(s[i]);
        }
        for(int i = 0; i<n; ++i)
            for(int j = 0; j<n; ++j)
                add(i, j);
        ans = 10000;
        for(int i = 0; i<n; ++i)
        {
            vis[i] = true;
            dfs(i, 1, len[i]);
            vis[i] = false;
        }
        cout<<ans<<endl;
    }
    return 0;
}