Submission #425567

#TimeUsernameProblemLanguageResultExecution timeMemory
425567MilosMilutinovicExam (eJOI20_exam)C++14
0 / 100
1083 ms844 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...