[알고리즘] 백준 2631 - 줄세우기 (C++) [문제 링크] : https://www.acmicpc.net/problem/2631#include using namespace std;int N, Maxi;int Arr[201];int DP[201];int main(){ cin >> N; for(int i=1; i> Arr[i]; } for(int i=1; i DP[i]){ DP[i] = DP[j] + 1; } } Maxi = max(Maxi, DP[i]); } cout 알고리즘 2025.01.12
