poj 1631 Bridging signals

 1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 int dp[40002];
 7 int n;
 8 
 9 int main(int argc, char const *argv[])
10 {
11     int t;
12     freopen("input.txt","r",stdin);
13     scanf("%d",&t);
14     while(t--) {
15         scanf("%d",&n);
16         int cnt = 0;
17         while(n--) {
18             int tmp;
19             scanf("%d",&tmp);
20             if(cnt == 0 || tmp > dp[cnt]) {
21                 cnt++;
22                 dp[cnt] = tmp;
23             }
24             else {
25                 int p = lower_bound(dp, dp+cnt+1, tmp) - dp;
26                 dp[p] = tmp;
27             }
28         }
29         printf("%d\n",cnt);
30     }    
31     return 0;
32 }