# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469657 | Itamar | Exam (eJOI20_exam) | C++14 | 9 ms | 344 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 <vector>
#include <algorithm>
using namespace std;
#include <iostream>
vector<int> pre;
int n;
/*int lower_bo(int l, int r, int val) {
int mid = (l + r) / 2;
if (pre[mid] < val && (mid == n || pre[mid+1] >= val) ) {
return mid+1;
}
if (pre[mid] < val) {
return lower_bo(mid + 1, r, val);
}
if (pre[mid] > val) {
return lower_bo(l, mid - 1, val);
}
}*/
int main()
{
int n;
cin >> n;
vector<int> r;
vector<int> m;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
m.push_back(x);
}
for (int i = 0; i < n; i++) {
int x;
cin >> x;
for (int j = i; j < n; j++) {
if (x == m[j]) {
r.push_back(x);
break;
}
}
}
int siz = r.size();
vector<int>max(siz, -1);
int mini = 0;
for (int i = 0; i < siz; i++) {
for (int j = 0; j < siz; j++) {
if (max[j] <= r[i] && max[j] != -1) {
if (max[j + 1] > r[i] || max[j + 1] == -1) {
max[j + 1] = r[i];
break;
}
}
}
if (max[0] > r[i] || max[0] == -1) {
max[0] = r[i];
}
}
int maxi = 0;
for (int i = siz-1; i >= 0; i--) {
if (max[i] != -1) {
cout << i+1;
break;
}
}
if (siz == 0) {
cout << 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... |