# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1049476 | mar | Exam (eJOI20_exam) | C++14 | 14 ms | 860 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;
typedef long long ll;
const int maxn = 100008;
ll dp[maxn];
int main() {
int n; cin>>n;
int ans=0;
vector<int> a, b;
bool flag = true;
int inp;
for(int i=0;i<n;i++) {
cin>>inp;
a.push_back(inp);
}
for(int i=0;i<n;i++){
cin>>inp;
b.push_back(inp);
}
vector<int> v;
map<int, int> idx;
for(int i=0; i<n; i++) idx[a[i]] = i;
for(int i=0; i<n; i++) {
if(idx.count(b[i]) && i <= idx[b[i]]) v.push_back(b[i]);
}
ll mx = 0;
ll sz = v.size();
for (int i=0; i<sz; i++) {
for(int j=0; j<i; j++) {
if(v[i] >= v[j]) {
dp[i] = max(dp[i], dp[j]+1);
}
}
}
for(int i=0; i<sz; i++) {
mx = max(mx,dp[i]);
}
cout<<mx+1<<endl;
return 0;
}
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... |