“玲珑杯”ACM比赛 Round #11 B题

http://www.ifrog.cc/acm/problem/1097?contest=1013&no=1

 //LIS的高端写法

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cassert>
 #include <algorithm>
 using namespace std;

 int b[];
 int f[];
 int n, x;

 int main() {
     while (scanf("%d", &n) != EOF) {
         assert( <= n && n <= );
         memset(f, 0x3f, sizeof f);
         for (int i = ; i < n; i++) {
             for (int j = ; j < ; j++) {
                 scanf("%d", &b[j]);
             }
             sort(b, b + );
             for (int j = ; j >= ; j--) {
                 *lower_bound(f, f + n, b[j]) = b[j];
             }
         }
         printf("%d\n", (int)(lower_bound(f, f + n, 0x3f3f3f3f) - f));
     }
     return ;
 }//标程