ICPCCamp 2016 Day 8 - Makoto Soejima's Contest #4(String Modification-模拟)

题意：给一个字符串s，每次可以在一个字符的右边加一个与这个字符不同的字符，问是否能变成字符串t？
1≤|s|≤|t|≤5000

模拟注意坑点

#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <functional>
#include <cstdlib>
#include <queue>
#include <stack>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p]) 
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (500000000000LL)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (6000)
char s[MAXN],t[MAXN];
int main() {
    cin>>s>>t;
    int n=strlen(s);
    int n2=strlen(t);
    if (s[0]!=t[0]||n>n2) {
        puts("No"); return 0;
    }

    int i=0,j=0;
    while (s[i]==s[i+1]) ++i;
    while (t[j]==t[j+1]) ++j;

    if (i<j) {
        puts("No"); return 0;
    }

    j=0;
    for(i=0;i<n;i++) {
        while (s[i]!=t[j] &&j<n2) ++j;
        if (s[i]!=t[j]) {
            puts("No"); return 0;
        } else ++j;
    }



    puts("Yes");


    return 0;
}