Submission #463809

#TimeUsernameProblemLanguageResultExecution timeMemory
463809AdamGSExam (eJOI20_exam)C++14
0 / 100
1081 ms30160 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define rep(a, b) for(int a = 0; a < (b); ++a) #define st first #define nd second #define pb push_back #define all(a) a.begin(), a.end() const int LIM=5007; map<int,int>mp; int a[LIM], b[LIM], ile[LIM][LIM], dp[LIM]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; rep(i, n) cin >> a[i]; rep(i, n) cin >> b[i]; rep(i, n) { mp.clear(); int ma=0; for(int j=i; j<n; ++j) { ++mp[b[j]]; ma=max(ma, a[j]); ile[i][j]=mp[ma]; } } rep(i, n) { rep(j, i+1) { if(j) { dp[i]=max(dp[i], dp[j-1]+ile[j][i]); } else { dp[i]=max(dp[i], ile[j][i]); } } } cout << dp[n-1] << '\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...