백준 11722번 C++

#include<iostream>

#include<algorithm>

using namespace std;

int arr[1001];

int ans[1001];

int n;

void caldown() {

ans[0] = 1;

int maxnum;

for (int i = 1; i < n; i++) {

maxnum = 0;

for (int j = i - 1; j != -1; j--) {

if (arr[j] > arr[i])

maxnum = max(maxnum, ans[j]);

}

if (maxnum != 0) 

ans[i] = maxnum + 1;

else

ans[i] = 1;

}

maxnum = 0;

for (int i = 0; i < n; i++) {

maxnum=max(maxnum, ans[i]);

}

cout << maxnum;

}

int main(void) {

cin >> n;

for (int i = 0; i < n; i++) {

cin >> arr[i];

}

caldown();

}