[HDOJ1261]最少拦截系统

 1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <iostream>
 6 #include <cmath>
 7 #include <queue>
 8 #include <map>
 9 #include <set>
10 #include <stack>
11 #include <list>
12 #include <vector>
13 
14 using namespace std;
15 
16 const int maxn = 30010;
17 int n;
18 int tmp;
19 int dp[maxn];
20 
21 int main() {
22     // freopen("in", "r", stdin);
23     while(~scanf("%d", &n)) {
24         int cnt = 1;
25         int flag = 0;
26         while(n--) {
27             scanf("%d", &tmp);
28             if(!flag) {
29                 dp[0] = tmp;
30                 flag = 1;
31             }
32             int i;
33             for(i = 0; i < cnt; i++) {
34                 if(tmp <= dp[i]) {
35                     dp[i] = tmp;
36                     break;
37                 }
38             }
39             if(i == cnt) {
40                 dp[cnt++] = tmp;
41             }
42         }
43         printf("%d\n", cnt);
44     }
45 }