Submission #984601

---

Source Code Expand

#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
queue<pint> q;
string s,t;
int num[1141919];
int main()
{
	int out=0,n;
	cin>>n;
	cin>>s;cin>>t;
	int now=n-1;
	for(int i=n-1;i>=0;i--){
		while(now>=0 && (now>i || s[now]!=t[i])) now--;
		//cout<<i<<' '<<now<<endl;
		if(now<0){
			cout<<-1<<endl;return 0;
		}
		num[i]=now;
	}
	for(int i=n-1;i>=0;i--){
		if(i<n-1 && num[i]==num[i+1]) continue;
		//if(num[i]==i) continue;
		q.push(mp(num[i],i));
		while(!q.empty() && q.front().fi>=i+q.size()-1) q.pop();
		out=max(out,(int)q.size());
	}
	cout<<out<<endl;
}

Submission Info

Judge Result