Submission #833255

#TimeUsernameProblemLanguageResultExecution timeMemory
833255vjudge1Exam (eJOI20_exam)C++17
0 / 100
11 ms340 KiB
#include <bits/stdc++.h> using namespace std; int n; int h[100005]; int t[100005]; int dp[100005]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> h[i]; } for (int i = 0; i < n; i++) { cin >> t[i]; } // subtask 3 dp[n] = 0; for (int i = n - 1; i >= 0; i--) { int cnt = 0; for (int j = i; j >= 0; j--) { if (h[i] == t[j]) cnt++; dp[j] = max(dp[j], dp[i + 1] + cnt); } } cout << dp[0] << '\n'; return 0; }
#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...