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;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
if (n <= 5000) {
vector<int> dp(n);
for (int i = 0; i < n; i++) {
int mx = 0;
map<int, int> cnt;
for (int j = i; j >= 0; j--) {
mx = max(mx, a[j]);
cnt[b[j]]++;
dp[i] = max(dp[i], (j == 0 ? 0 : dp[j - 1]) + cnt[mx]);
}
}
int ans = *max_element(dp.begin(), dp.end());
cout << ans << '\n';
return 0;
}
return 0;
}
| # | 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... |