最长上升子序列[LIS]

template<typename T> int LIS_nlogn(T * s, T * e)
{
    if (s > e) return 0;
    T g[e - s + 5];
    int ret = 0;
    memset(g, 0, sizeof(g));
    for (T * i = s; i <= e; i++)
    {
        if (g[ret] < (*i))
        {
            g[++ret] = (*i);
            continue;
        }
        int l = 1, r = ret, mid;
        while (l < r)
        {
            mid = (l + r) >> 1;
            if ((*i) < g[mid]) r = mid;
            else l = mid + 1;
        }
        g[l] = (*i);
    }
    return ret;
}