CodeVS 1018 单词接龙 题解

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;

int N, ans;
char word[20+2][255+2], root;
int connect[20+2][20+2];
int cnt[20+2];

void DFS(int n, int len){
	for(int i = 0; i<N; ++i) if(connect[n][i]!=0 && cnt[i]<2){
		++cnt[i];
		DFS(i, len+connect[n][i]);
		--cnt[i];
	}
	if(len>ans) ans = len;
	return;
}

int Con(int a, int b){
	char *p1, *p2;
	p1 = word[a]+strlen(word[a])-1;
	while(p1!=word[a]){
		p2 = strstr(word[b], p1);
		if(p2 == NULL || p2 != word[b]){
			--p1;
			continue;
		}
		return strlen(word[b])-strlen(p1);
	}
	return 0;
}

int main() {
	cin >> N;
	for(int i = 0; i<N; ++i) cin >> word[i];
	cin >> root;
	for(int i = 0; i<N; ++i){
		for(int j = 0; j<N; ++j){
			connect[i][j] = Con(i, j);
		}
	}
	for(int i = 0; i<N; ++i) if(*word[i]==root){
	    ++cnt[i];
	    DFS(i, strlen(word[i]));
	    --cnt[i];
	} 
	cout << ans << endl;
	fclose(stdin); fclose(stdout); return 0;
}