[C++] 백준 14462번: 소가 길을 건너간 이유 8

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector<vector<int>> map(2, vector<int>(N+1, 0));
    vector<vector<int>> dp(N+1, vector<int>(N+1, 0));
    
    for (int i = 0; i < 2; i++) {
        for (int j = 1; j < N+1; j++) {
            cin >> map[i][j];
        }
    }
    
    for (int i = 1; i < N+1; i++) {
        for (int j = 1; j < N+1; j++) {
            dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
            if (abs(map[0][i]-map[1][j]) <= 4) {
                dp[i][j] = dp[i-1][j-1] + 1;
            }
        }
    }
    
    cout << dp[N][N];
    
}