#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> a(n),b(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
vector<int> v;
for(int i=0;i<n;i++){
if(a[i]>b[i])continue;
bool ok=false;
for(int j=0;j<n;j++)if(b[i]==a[j])ok=true;
if(!ok)continue;
v.push_back(b[i]);
}
n=v.size();
vector<int> lis(n+1,-1);
lis[0]=1;
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(v[j]<=v[i])lis[i]=max(lis[i],lis[j]+1);
}
}
int ans=0;
for(int i=0;i<n;i++)ans=max(ans,lis[i]);
cout<<ans<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |