제출 #1253322

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253322		osmiyum	Exam (eJOI20_exam)	C++20	0 / 100	1093 ms	5960 KiB

exam

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define ins insert
#define mid ((start+end)/2)
using namespace std;
const int MOD=1e9+7;
const int INF=2e5+5;
typedef pair<int,int> pii;
typedef pair<int,pair<int,int>> piii;
int n,m,q,ans;
int sz=0;
int cev=0;
int a[INF];
int b[INF];
vector<int> dp(INF,-1);

inline int f(int x){
    if(x>n)return 0;
    if(dp[x]!=-1)return dp[x];
    int cev=0;
    map<int,int> mp;
    int mx=0;
    for(int i=x;i<=n;i++){
        mx=max(mx,a[i]);
        mp[b[i]]++;
        //cout<<mp[mx]<<endl;
        cev=max(cev,f(i+1)+mp[mx]);
    }
    return dp[x]=cev;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)cin>>b[i];
    cout<<f(1)<<endl;

    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22