| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 699276 | mmmmaasss | Exam (eJOI20_exam) | C++14 | 398 ms | 392448 KiB | 
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>
using namespace std;
#define ll long long
int main()
{
   int n;cin >> n;
   int rr = 0;
    vector<int> a(n + 1) , b(n + 1);
    for(int i = 1;i <= n;i ++){
        cin >> a[i];
    }
    for(int i = 1;i <= n;i ++){
        cin >> b[i];
    }
    vector<vector<ll>> dp(n + 1 , vector<ll>(n + 1)) , p(n + 1 , vector<ll>(n + 1));
    for(int i = 1;i <= n;i ++){
        int c = a[i] == b[i];
        dp[i][i] = c;
        for(int j = i - 1;j >= 1;j --){
            c += a[i] == b[j];
            p[j][i] = c;
        }
    }
    for(int i = 1;i <= n;i ++){
        for(int j = i - 1;j >= 1;j --){
            dp[1][i] = max(p[j][i] + dp[1][j],dp[1][i]);
        }
    }
    cout << dp[1][n] << endl;
}
Compilation message (stderr)
| # | 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... | ||||
