题目大意:求最长上升子序列
解题思路:裸题
#include <cstdio>
#include <cstring>
const int N = 1010;
int num[N];
int n;
int find(int r, int t) {
int l = 0, mid;
while (l < r) {
int mid = (l + r) / 2;
if (num[mid] < t) l = mid + 1;
else r = mid;
}
return r;
}
void solve() {
int top = 0, t;
num[0] = -1;
for (int i = 0; i < n; i++) {
scanf("%d", &t);
if (t > num[top]) num[++top] = t;
else num[find(top, t)] = t;
}
printf("%d\n", top);
}
int main() {
while (scanf("%d", &n) != EOF) solve();
return 0;
}