第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-678 单词接龙

#include<stdio.h>

#include<string.h>

#define MAX 10010

int n;

int max=0;

char blong[MAX+1];

char word[21][MAX+1];

int vis[21]={0};

int check(int x,char a[MAX+1])

{

int i,j,k;

int len=0;

int len2=0;

len=strlen(a)-1; 

len2=strlen(word[x])-1;

for(i=len;i>=0&&len2;i--,len2--)

{

if(a[i]==word[x][0])

{

// while(a[len]==a[i-1])

// i--;

k=1;

for(j=i+1;j<=len;j++)

{

if(a[j]!=word[x][k])

break;

k++;

}

if(j>len)

return i;

}

}

return 0;

 

}



void dfs(char a[MAX+1])

{

int i,j,sum=0;

int len=0,llong,flag=0;

char add[MAX+1];

for(i=0;i<n;i++)

{

if(vis[i]<2)

{

len=check(i,a);

if(len)

{

for(j=0;j<len;j++)

{

add[j]=a[j];

  } 

    strcat(add,word[i]);

    vis[i]++;

    dfs(add);

  vis[i]--;

  memset(add,0,sizeof(add));

}

}

len=strlen(a);

if(len>max)

{ 

max=len;


}

}

return;

} 







int main()

{

int i;

scanf("%d",&n);

for(i=0;i<=n;i++)

scanf("%s",&word[i]);

    for(i=0;i<n;i++)

    {

    if(word[i][0]==word[n][0])

    {

    vis[i]++;

    dfs(word[i]);

    vis[i]--;

}

}

printf("%d\n",max);

return 0;

}

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 21;

int n, ans;
string word[N];
int g[N][N]; 
int used[N]; 

void dfs(string dragon, int last)
{
    ans = max((int)dragon.size(), ans);
    
    used[last] ++ ;
    
    for (int i = 0; i < n; i ++ )
        if (g[last][i] && used[i] < 2)
            dfs(dragon + word[i].substr(g[last][i]), i);
    
    used[last] -- ; 
}

int main()
{
    cin >> n;
    for (int i = 0; i < n; i ++ ) cin >> word[i];
    char start;
    cin >> start;
    
    
    for (int i = 0; i < n; i ++ )
        for (int j = 0; j < n; j ++ )
        {
            string a = word[i], b = word[j];
            for (int k = 1; k < min(a.size(), b.size()); k ++ ) 
                if (a.substr(a.size() - k) == b.substr(0, k))   
                {
                    g[i][j] = k;
                    break;
                }
        }
    
    for (int i = 0; i < n; i ++ )
        if (word[i][0] == start)
            dfs(word[i], i);
    
    cout << ans << endl;        
    
    return 0;
}

import java.io.*;
import java.util.*;

class Main {
    ReadIn readIn = new ReadIn(System.in);
    PrintWriter printWriter = new PrintWriter(System.out, true);

    int num;       
    String[] map;     
    int[] flag;         
    int[][] diff;       
    int max = 0;       

    public void run() throws IOException {
        num = readIn.nextInt();
        map = new String[num];
        flag = new int[num];
        diff = new int[num][num];

        for (int i = 0; i < num; i++) {
            map[i] = readIn.next();
        }

        String startString = readIn.next(); 

        for (int i = 0; i < num; i++) {  
            for (int j = 0; j < num; j++) {
                int len = Math.min(map[i].length(), map[j].length()); 
                for (int k = 1; k < len; k++) {
                    if (map[i].substring(map[i].length() - k)
                        .equals(map[j].substring(0, k))) {
                        diff[i][j] = k;
                        break;
                    }
                }
            }
        }

        for (int i = 0; i < num; i++) {
            if (map[i].startsWith(startString)) {
                dfs(i, map[i].length());
            }
        }

        System.out.println(max);
    }

    private void dfs(int start, int len) {
        flag[start]++;
        for (int i = 0; i < num; i++) {
            if(diff[start][i]!=0 && flag[i] < 2)
                dfs(i,len + map[i].length() - diff[start][i]);
        }
        flag[start] -- ;
        max = Math.max(max,len);
    }

    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    static class ReadIn {
        private StringTokenizer stringTokenizer;
        private BufferedReader bufferedReader;

        public ReadIn(InputStream inputStream) {
            bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
            stringTokenizer = new StringTokenizer("");
        }

        public String next() throws IOException {
            if (!stringTokenizer.hasMoreTokens()) {
                stringTokenizer = new StringTokenizer(bufferedReader.readLine());
            }
            return stringTokenizer.nextToken();
        }

        public int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }
    }

}

def dfs(length,s):
    global res
    if res < length:
        res = length
        
    for i in range(n):
        if vis[i] < 2:
            for start in range(1,length):
                if length - start <= len(data[i]) - 1 and length - start >= 1:
                    if s[start:] == data[i][:length - start]:
                        vis[i] += 1
                        dfs(len(data[i]) + start,s + data[i][length - start:])
                        vis[i] -= 1#回溯


n = int(input())
data = []
for i in range(n):
    data.append(input())

head = input()
res = 0
for i in range(n):
    if data[i][0] == head:
        vis = [0]*(n)
        vis[i] = 1
        dfs(len(data[i]),data[i])
    
print(res)