Submission #1311713

#	Time	Username	Problem	Language	Result	Execution time	Memory
1311713		andreidumitrache	Exam (eJOI20_exam)	C++20	0 / 100	1096 ms	684 KiB

exam

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5;

int dp[MAXN + 1] , a[MAXN + 1] , b[MAXN + 1];
map< int , int >f;
int main() {
    int n , i , j , maxi;
    cin >> n;
    for( i = 1 ; i <= n ; i++ )
        cin >> a[i];
    for( i = 1 ; i <= n ; i++ )
        cin >> b[i];
    maxi = 0;
    for( i = 1 ; i <= n ; i++ ) {
        maxi = 0;
        for( j = i ; j >= 1 ; j-- ) {
            f[b[j]]++;
            maxi = max( maxi , a[j] );
            dp[i] = max( dp[i] , f[maxi] + dp[j - 1] );
        }
        //cout << i << ' ' << dp[i] << '\n';
        for( j = i ; j >= 1 ; j-- )
            f[b[j]]--;
    }
    cout << dp[n] << '\n';
    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