# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844092 | Acanikolic | Exam (eJOI20_exam) | C++17 | 1043 ms | 856 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>
#define int long long
using namespace std;
signed main() {
int n;
cin >> n;
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];
int res = 0;
vector<int>dp(n+1,0);
for(int r=1;r<=n;r++) {
for(int l=1;l<=r;l++) {
int mx = 0;
for(int j=l;j<=r;j++) mx = max(mx,a[j]);
int cnt = 0;
for(int j=l;j<=r;j++) if(b[j] == mx) cnt += 1;
dp[r] = max(dp[r],dp[l-1]+cnt);
}
}
//for(int i=1;i<=n;i++) cout << dp[i] << ' ';
cout << dp[n];
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... |