POJ 1699 Best Sequence(DFS)

题目链接

judge函数没写好，直接暴力就可以水过去。

#include <cstring>
#include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
char str[21][31];
int p[21][21];
int len[21];
int o[21],minz,n;
int judge(int x,int y)
{
    int len1,len2,i,j,k,ans,minz,flag;
    len1 = strlen(str[x]);
    len2 = strlen(str[y]);
    minz = min(len1,len2);
    ans = 0;
    for(k = 1;k <= minz;k ++)
    {
        flag = 1;
        for(i = 0,j = len1-k;i < k;i ++,j ++)
        {
            if(str[x][j] != str[y][i])
            {
                flag = 0;
                break;
            }
        }
        if(flag) ans = k;
    }
    return len2-ans;
}
void dfs(int x,int step,int sum)
{
    int i;
    if(step >= minz)
    return ;
    if(sum == n)
    {
        minz = min(minz,step);
        return ;
    }
    for(i = 1;i <= n;i ++)
    {
        if(!o[i])
        {
            o[i] = 1;
            dfs(i,step+p[x][i],sum+1);
            o[i] = 0;
        }
    }
}
int main()
{
    int i,t,j;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(o,0,sizeof(o));
        minz = 0;
        for(i = 1;i <= n;i ++)
        {
            scanf("%s",str[i]);
            len[i] = strlen(str[i]);
            minz += len[i];
        }
        for(i = 1;i <= n;i ++)
        {
            for(j = 1;j <= n;j ++)
            {
                if(i != j)
                {
                    p[i][j] = judge(i,j);
                }
            }
        }
        for(i = 1;i <= n;i ++)
        {
            o[i] = 1;
            dfs(i,len[i],1);
            o[i] = 0;
        }
        printf("%d
",minz);
    }
    return 0;
}