UVa 231 - Testing the CATCHER

　　题目大意：一种拦截导弹能拦截多枚导弹，但是它在每次拦截后高度不会再升高，给出导弹的序列，问最多能拦截多少枚导弹？

　　最长递减子序列问题。

 #include <cstdio>
 #include <vector>
 #include <algorithm>
 using namespace std;

 vector<int> m, lds;

 int main()
 {
 #ifdef LOCAL
     freopen("in", "r", stdin);
 #endif
     int x, kase = ;
     while (scanf("%d", &x) != EOF && x != -)
     {
         kase++;
         m.clear();
         m.push_back(x);
         while (scanf("%d", &x) && x != -)
             m.push_back(x);
         lds.clear();
         lds.resize(m.size(), );
         for (int i = ; i < m.size(); i++)
         {
             for (int j = ; j < i; j++)
                 if (m[i] < m[j] && lds[j]+ > lds[i])
                     lds[i] = lds[j] + ;
         }
         int ans = ;
         for (int i = ; i < lds.size(); i++)
             ans = max(ans, lds[i]);
         if (kase > )  printf("\n");
         printf("Test #%d:\n  maximum possible interceptions: %d\n", kase, ans);
     }
     return ;
 }