This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define endl '\n'
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin>>n;
pair<int,int>pr[n];
for(int i=0;i<n;i++){
cin>>pr[i].first;
}
for(int i=0;i<n;i++){
cin>>pr[i].second;
}
int arr[n];
for(int i=0;i<n;i++)arr[i]=0;
for(int i=0;i<n;i++){
if(i>0)arr[i]=arr[i-1];
int temp=0;
for(int w=i-1;w>=0;w--){
if(pr[w].second==pr[i].first)temp++;
if(temp+(w>0?arr[w-1]:0)>arr[i])arr[i]=temp+(w>0?arr[w-1]:0);
}
if(pr[i].first==pr[i].second)arr[i]++;
}
cout<<arr[n-1];
}
# | 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... |