Submission #1213377

#TimeUsernameProblemLanguageResultExecution timeMemory
1213377ttamxExam (eJOI20_exam)C++20
13 / 100
15 ms328 KiB
#include<bits/stdc++.h>

using namespace std;

const int N=5005;

int n;
int a[N],b[N],dp[N];

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n;
    for(int i=1;i<=n;i++)cin >> a[i];
    for(int i=1;i<=n;i++){
        cin >> b[i];
        if(b[i]<a[i])b[i]=0;
    }
    for(int i=1;i<=n;i++){
        int mx=0;
        for(int j=1;j<=n;j++){
            mx=max(mx,dp[j]);
            if(b[i]==a[j])dp[j]=mx+1;
        }
    }
    cout << *max_element(dp+1,dp+n+1);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...