줄 세우기 더블릿

#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
int arr[300] = { 0 };
int dp[300] = { 0 };
int par[300] = { 0 };
int tmp = 0;
 
void findPar(int x) {
    if (x == 0) return;
 
    tmp++;
    findPar(par[x]);
}
 
int main() {
    int n;
    scanf("%d", &n);
 
    for (int i = 1; i <= n; i++) {
        scanf("%d", &arr[i]);
    }
 
    dp[1] = 1;
    for (int i = 2; i <= n; i++) {
        int maxNum = 0;
        for (int j = 1; j < i; j++) {
            if (arr[j] < arr[i]) {
                if (maxNum < dp[j]) {
                    maxNum = dp[j];
                    par[i] = j;
                }
            }
        }
        dp[i] = maxNum + 1;
    }
 
    int maxNum = 0,x;
    for (int i = 1; i <= n; i++) {
        if (maxNum < dp[i]) {
            x = i;
            maxNum = dp[i];
        }
    }
    findPar(x);
 
    printf("%d", n-tmp);
}