最长上升子序列问题

#include <cstdio>
#include <algorithm>
using namespace std;

int n;
int a[1000];
int dp[1000];

void solve()
{
int res = 0;
for (int i = 0; i < n; i++){
dp[i] = 1;
for (int j = 0; j < i; j++){
if (a[j] < a[i]){
dp[i] = max(dp[i], dp[j] + 1);
}
}
res = max(res, dp[i]);
}
printf("%d\n", res);
}

int main()
{
while (scanf("%d", &n) != EOF){
for (int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
solve();
}
return 0;
}

int dp[max_n];
void solve()
{
fill(dp, dp + n, INF);
for (int i = 0; i < n; i++){
*lower_bound(dp, dp + n, a[i]) = a[i];
}
printf("%d\n", lower_bound(dp, dp + n, INF) - dp);
}