最少拦截系统

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <algorithm>
 5 #define N 1000005
 6 using namespace std;
 7 int n,i,t,a[N];
 8 int main(void){
 9     while(~scanf("%d",&n)){
10         int k=0;
11         while(n--){
12             scanf("%d",&t);
13             i=lower_bound(a,a+k,t)-a;
14             a[i]=t;
15             if(i==k)k++;
16         }
17         printf("%d\n",k);
18     }
19 }