CodeForces 155C Hometask （DP+复杂做法）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+100;
const int ub=1e6;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
/*
模拟。
总感觉自己的做法复杂了
*/
int n,dp[maxn],ans=0;
string s[20],t;
int judge(int x){
    rep(i,1,n+1){
        if(s[i][0]==t[x]&&s[i][1]==t[x+1]) return i;
        if(s[i][0]==t[x+1]&&s[i][1]==t[x]) return i;
    }
    return 0;
}
int cnt[30];
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>t>>n;
    rep(i,1,n+1) cin>>s[i];
    for(int i=0;i<t.size();i++){
        int p=i+1,q=i;
        if(p>=t.size()||t[p]==t[q]) continue;
        int idx=judge(i);
        if(idx){
            dp[p]=dp[q]=idx;
            while(p+1<t.size()&&t[p]==t[p+1]){
                p++;
                dp[p]=idx;
            }
            while(q-1>=0&&t[q-1]==t[q]){
                q--;
                dp[q]=idx;
            }
        }
    }
    int ans=0;
    for(int i=0;i<t.size();i++){
        if(!dp[i]) continue;
        int j=i;
        while(j+1<t.size()&&dp[j+1]==dp[j]) j++;
        mst(cnt,0);
        for(int k=i;k<=j;k++) cnt[t[k]-'a']++;
        ans+=min(cnt[s[dp[i]][0]-'a'],cnt[s[dp[i]][1]-'a']);
        i=j;
    }
    cout<<ans<<"\n";
    return 0;
}