把三个字符拆成前面两个和后面两个,建图,做欧拉回路就行了。。。
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 128 * 128
#define maxm 200005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head
vector<int> g[maxn];
string ans;
int du[maxn];
char s[50];
int n;
void dfs(int u)
{
while(!g[u].empty()) {
int v = g[u][0];
g[u][0] = g[u].back();
g[u].pop_back();
dfs(v);
}
ans += u % 128;
}
void read()
{
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%s", s);
int u = s[0] * 128 + s[1];
int v = s[1] * 128 + s[2];
g[u].push_back(v);
du[u]++, du[v]--;
}
}
void work()
{
int o = 128 * 128, st = -1, cnt = 0;
for(int i = 0; i < o; i++)
if(du[i] > 0) cnt++, st = i;
if(cnt >= 2 || du[st] > 1) {
printf("NO\n");
return;
}
if(st == -1) for(st = 0; st < o; st++) if(g[st].size() > 0) break;
dfs(st);
ans += st / 128;
reverse(ans.begin(), ans.end());
if(ans.size() == n+2) printf("YES\n%s", ans.c_str());
else printf("NO\n");
}
int main()
{
read();
work();
return 0;
}