题目链接:https://www.luogu.org/problemnew/show/P1019
思路:用dfs暴力搜索每一种“接龙”情况,此处注意每个单词只能在接龙中出现两次,同时为了保证接龙最长,每两个单词如果有多种合并方式,重合部分应最短
c++代码:
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int maxn=60;
struct node {
string s;
int p;
node(string a,int t):s(a),p(t){}
node(){}
};
vector <node> v;
int vis[maxn];
string s[maxn];
int ans;
int cnt;
int n;
string merge(string a,string b) {
int i;
int ti=0;
string res="";
int len=min(a.length(),b.length());
for( i=1;i<=len;i++) {
if(a.substr(a.length()-i,i)==b.substr(0,i)&&i<len) {
{
ti=i;
break;
}
}
}
if(!ti)return "";
else {
res=a.substr(0,a.length()-ti)+b;
return res;
}
}
void dfs(string t,int p,int& num) {
int len=t.length();
num=max(len,num);
for(int i=0;i<n;i++) {
if(vis[i]>=2)continue;
string q=merge(t,s[i]);
if(q=="")continue;
else {
vis[i]++;
dfs(q,i,num);
vis[i]--;
}
}
}
int main() {
scanf("%d",&n);
for(int i=0;i<n;i++ ) {
cin >> s[i];
}
char c;
cin >> c;
for(int i=0;i<n;i++)
{
if(s[i][0]==c)v.push_back(node(s[i],i));
}
memset(vis,0,sizeof(vis));
for(int i=0;i<(int)v.size();i++)
{
cnt=0;
vis[v[i].p]=1;
dfs(v[i].s,v[i].p,cnt);
if(cnt>ans)ans=cnt;
vis[v[i].p]=0;
}
cout << ans <<endl;
return 0;
}