codeforces----208B Solitaire

记忆化搜索，有思路了之后还是很好写的。

#include <iostream>
#include <cstring>
#include <cstdio>

#define N 55
#define DP dp[n][ch1][ch2][ch3]

using namespace std;

const char str1[]="23456789TJQKA";
const char str2[]="SDHC";

int card[N],dp[N][N][N][N];

bool check(int a,int b){
    if(a/13==b/13||a%13==b%13) return 1;
    return 0;
}

bool dfs(int n,int ch1,int ch2,int ch3){
    if(DP!=-1) return DP;
    if(n==0) return check(ch2,ch3)&&check(ch1,ch3);
    if(check(ch2,ch3)&&dfs(n-1,card[n],ch1,ch3)) { DP=1; return 1; }
    if(check(card[n],ch3)&&dfs(n-1,ch3,ch1,ch2)) { DP=1; return 1; }
    DP=0; return 0;
}

int change(const char str[],char ch){
    for(int i=0;str[i];i++) if(ch==str[i]) return i;
}

int main(){
    int n;
    char ch1,ch2;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>ch1>>ch2;
        card[i]=change(str1,ch1)*13+change(str2,ch2);
    }
    memset(dp,-1,sizeof(dp));
    if(n==1||(n==2&&check(card[1],card[2]))||(n>=3&&dfs(n-3,card[n-2],card[n-1],card[n])))
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return 0;
}