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;
typedef long unsigned long ull;
typedef double long ld;
int main() {
ios::sync_with_stdio(!cin.tie(0));
int n;
cin >> n;
vector<int> a(n), b(n);
for (int& i : a) cin >> i;
for (int& i : b) cin >> i;
vector<int> dp(n);
for (int i = 0; i < n; i++) {
int mx = 0;
for (int j = i; j < n; j++) {
mx = max(mx, a[j]);
int cnt = 0;
for (int l = i; l <= j; l++) {
cnt += b[l] == mx;
}
dp[j] = max(dp[j], (i == 0 ? 0 : dp[i - 1]) + cnt);
}
}
cout << *max_element(dp.begin(), dp.end()) << '\n';
}
| # | 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... |