[BAE/<JOON> 문제풀이] 1965. 상자넣기 (DP.038)

https://www.acmicpc.net/problem/1965

1965번: 상자넣기

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    vector<int> arr, dp;
    int n;
    cin >> n;
    arr.resize(n + 1);
    dp.resize(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    
    dp[1] = 1;
    for (int i = 2; i <= n; i++) {
        int mx = 0;        
        for (int j = 1; j < i; j++) {
            if (mx < dp[j] && arr[j] < arr[i]) {
                mx = dp[j];
            }
        }
        dp[i] = mx + 1;
    }

    int mxx = dp[1];
    for (int i = 1; i <= n; i++) {                
        if (mxx < dp[i]) mxx = dp[i];
    }
    cout << mxx;
    return 0;
}