[BAEKJOON] 1965 상자넣기

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n; vector<int>map(1001, 0), DP(1001, 0); scanf("%d", &n); for (int j = 0; j < n; j++) scanf("%d", &map[j]); int Max = 0; for (int j = 0; j < n; j++) { Max = 0; for (int k = 0; k < j; k++) { if (map[j] > map[k]) Max = max(Max, DP[k]); } DP[j] = Max + 1; } Max = 0; for (int j = 0; j < n; j++) Max = max(Max, DP[j]); printf("%d", Max); return 0; }