POJ 1631 Bridging signals

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 using namespace std;
 5 const int INF=100000;
 6 int stick[40000];
 7 int dp[40000];
 8 int main()
 9 {
10     int T;
11     cin>>T;
12     while(T--)
13     {
14         int n;
15         cin >> n;
16         for (int i = 0; i < n; ++i)
17         {
18             cin >>stick[i];
19         }
20         fill(dp,dp+n,INF); 
21         for (int j = 0; j < n; ++j)
22         {
23               *lower_bound(dp,dp+n,stick[j])=stick[j]; 
24         }
25         cout<<lower_bound(dp,dp+n,INF)-dp<<endl;
26     }
27     return 0;
28 }