# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844077 | Acanikolic | Exam (eJOI20_exam) | C++14 | 1046 ms | 604 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;
for(int l=1;l<=n;l++) {
for(int r=l;r<=n;r++) {
int pre = 0,posle = 0,cnt = 0;
for(int j=1;j<l;j++) if(a[j] == b[j]) pre += 1;
for(int j=r+1;j<=n;j++) if(a[j] == b[j]) posle += 1;
int mx = 0;
for(int j=l;j<=r;j++) mx = max(mx,a[j]);
for(int j=l;j<=r;j++) if(b[j] == mx) cnt += 1;
res = max(res,pre+posle+cnt);
}
}
cout << res;
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... |