CodeForces - 224D Two Strings

最新推荐文章于 2021-03-29 18:52:23 发布

邵光亮

最新推荐文章于 2021-03-29 18:52:23 发布

阅读量562

点赞数 1

分类专栏：笔记

本文链接：https://blog.csdn.net/qq_43627087/article/details/97244670

版权

笔记专栏收录该内容

262 篇文章 3 订阅

订阅专栏

Description：

A subsequence of length |x| of string s = s1s2... s|s| (where |s| is the length of string s) is a string x = sk1sk2... sk|x| (1 ≤ k1 < k2 < ... < k|x| ≤ |s|).

You've got two strings — s and t. Let's consider all subsequences of string s, coinciding with string t. Is it true that each character of string s occurs in at least one of these subsequences? In other words, is it true that for all i(1 ≤ i ≤ |s|), there is such subsequence x = sk1sk2... sk|x| of string s, that x = tand for some j (1 ≤ j ≤ |x|) kj = i.

Input

The first line contains string s, the second line contains string t. Each line consists only of lowercase English letters. The given strings are non-empty, the length of each string does not exceed 2·105.

Output

Print "Yes" (without the quotes), if each character of the string s occurs in at least one of the described subsequences, or "No" (without the quotes) otherwise.

Examples

Input

abab
ab

Output

Yes

Input

abacaba
aba

Output

No

Input

abc
ba

Output

No

Note

In the first sample string t can occur in the string s as a subsequence in three ways: abab, abab and abab. In these occurrences each character of string s occurs at least once.

In the second sample the 4-th character of the string s doesn't occur in any occurrence of string t.

In the third sample there is no occurrence of string t in string s.

这道题的题意真的很难理解，昨天的理解一直是错的，今天想了好久才明白，原来是判断S串是否可以由T串构成，意思就是在S串中找到一个包含所有字母的子序列，判断这个子序列是否等于T串，T串忍忍拆，按照顺序覆盖B串，是否可以完全覆盖，一定是按照顺序。先从左往右循环一遍记录S串中字母在T串中出现的位置，再从右往左循环一遍，记录S串中字母在T串中出现的位置，最后判断。

感谢LSD学长的耐心讲解。

AC代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdlib.h>
#include <queue>
#include <vector>
#include<map>
const int INF = 0x3f3f3f3f;
using namespace std;
typedef long long ll;
typedef double ld;
#define mn 1000010
int i,j,k;
int n,m;
int c,d;
int cnt;
using namespace std;
int main()
{
    string a,b;
    int left[200005],right[200005];
    memset(left,-1,sizeof(left));
    memset(right,-1,sizeof(right));
    int vis[27];
    memset(vis,-1,sizeof(vis));
    cin>>a>>b;
    for(i=0,j=0;i<a.size();i++)
    {
        if(a[i]==b[j]&&j<=b.size())
        {
            left[i]=vis[a[i]-'a']=j;
            j++;
        }
        else
         left[i]=vis[a[i]-'a'];
    }
    /*for(i=0;i<a.size();i++)
        cout<<left[i]<<" ";
    cout<<endl;*/
    /*for(char c='a';c<='z';c++)
        cout<<vis[c-'a']<<" ";
    cout<<endl;*/
    memset(vis,-1,sizeof(vis));
    for(i=a.size()-1,j=b.size()-1;i>=0;i--)
    {
        if(a[i]==b[j]&&j>=0)
        {
            right[i]=vis[a[i]-'a']=j;
            j--;
        }
        else
          right[i]=vis[a[i]-'a'];
    }
    /*for(i=0;i<a.size();i++)
        cout<<right[i]<<" ";
    cout<<endl;*/
    bool flag=1;
    for(i=0;i<a.size();i++)
    {
        //cout<<left[i]<<" "<<right[i]<<endl;
        if(right[i]==-1||left[i]==-1||left[i]<right[i])
        {
            flag=0;
            cout<<"No"<<endl;
            break;
        }
    }
    if(flag==1)
    cout<<"Yes"<<endl;
    return 0;
}