D2. Remove the Substring (hard version)(思维+贪心)

https://codeforces.com/problemset/problem/584/C

---

思路:

维护一下第二个序列的串每个位置的可取范围，用两个map。

然后一前一后贪心交替取出max

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char a[maxn],b[maxn];
map<LL,LL>map1,map2;
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  cin>>(a+1);LL n=strlen(a+1);
  cin>>(b+1);LL m=strlen(b+1);
  LL j=1;
  for(LL i=1;i<=n;i++){
     if(a[i]==b[j]&&j<=m){
        map1[j]=i;
        j++;
     }
  }
  j=m;
  for(LL i=n;i>=1;i--){
    if(a[i]==b[j]&&j>0){
        map2[j]=i;
        j--;
    }
  }
  LL ans=0;
  for(LL i=1;i<=m;i++){
      if(i==1){
        if(map2[i]>1) ans=max(ans,map2[i]-1);
       /// debug(ans);
        if(!map2.count(i+1) ) ans=max(ans,n-map1[i]);
        else if(map2[i+1]-map1[i]>1) ans=max(ans,map2[i+1]-map1[i]-1);
      }
      else if(i==m){
        if(map2[i]-map1[i-1]>1) ans=max(ans,map2[i]-map1[i-1]-1);
       /// debug(ans);

        if(n-map1[i]>1)  ans=max(ans,n-map1[i]);
      ///  debug(ans);
      }
      else{
        if(map2[i]-map1[i-1]>1) ans=max(ans,map2[i]-map1[i-1]-1);

        else if(map2[i+1]-map1[i]>1) ans=max(ans,map2[i+1]-map1[i]-1);
      }
     /// debug(ans);
  }
  ans=max(ans,n-map1[m]);
  cout<<ans<<"\n";
return 0;
}