BOJ 1965 - 상자넣기 [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
void solve(void) {
  int n;
  cin >> n;
  vector<int> a(n+1);
  for (int i=1; i<=n; i++) cin >> a[i];
 
  vector<int> dp(n+1, 1);
  for (int i=1; i<=n; i++) {
    for (int j=1; j<i; j++) {
      if (a[j] < a[i]) dp[i] = max(dp[i], dp[j]+1);
    }
  }
  
  cout << *max_element(dp.begin(), dp.end()) << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}