uva10340 all in all 字符串

/* ***********************************************
Author        :fisty
Created Time  :2014/12/14 15:36:40
File Name     :uva10340.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;
string s,t;
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    while(cin >> s >> t){
        //判断s是否为t的子序列
        int k = 0;
        int ok = 0;
        if(s.length() > t.length()){
            //先判断s长度不可以长于t
            printf("No\n");
            continue;
        }
        for(int i = 0;i < s.length(); i++){
            for(int j = k;j < t.length(); j++){
                if(t[j] == s[i]){
                    //如果找到匹配的t串的下标需要从j+1开始匹配
                    k = j+1;
                    break;
                }
                if(j == t.length()-1){
                    //如过主序列没有对应的字母
                    printf("No\n");
                    ok = 1;
                }
            }
        }
        if(!ok) //如果上述匹配过程通过则YES
            printf("Yes\n");
    }
    return 0;
}