Submission #1164218

#TimeUsernameProblemLanguageResultExecution timeMemory
1164218andrei_nExam (eJOI20_exam)C++20
0 / 100
9 ms328 KiB
#include <bits/stdc++.h>

using namespace std;

int a[100005],b[100005];
int dp[5005][2];

signed main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int n; cin>>n;
    for(int i=1; i<=n; ++i) cin>>a[i];
    for(int i=1; i<=n; ++i) cin>>b[i];
    for(int i=1; i<=n; ++i)
    {
        dp[i][0] = max(dp[i-1][0], dp[i-1][1]) + (a[i] == b[i]);
        int cnt = (a[i] == b[i]);
        for(int j=i-1; j>0; --j)
        {
            if(b[j] == a[i]) ++cnt;
            dp[i][0] = max(dp[i][0], dp[j][1] + cnt);
        }


    }
    cout<<max(dp[n][0], dp[n][1]);
    return 0;
}
#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...