“玲珑杯”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[10];
int f[600020];
int n, x;

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