Submission #1735805

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a[5010],b[5010];

int main(){
	cin >> n >> m;
	REP(i,0,n) cin >> a[i];
	REP(i,0,m) cin >> b[i];
	
	int ma=0;
	REP(i,0,m){
		int x=i,c=0;
		REP(j,0,n){
			if(a[j]==b[x]) x++,c++;
			if(x>=m) break;
		}
		
		ma=max(ma,c);
	}
	
	cout << ma << endl;
	return 0;
}

Submission Info

Judge Result