最长上升子序列

问题描述如下：

A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of

the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK),

where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has

ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered

subsequences are of length 4, e. g., (1, 3, 5, 8).

Your program, when given the numeric sequence, must find the length of

its longest ordered subsequence

解决方案----贪心+二分查找

定义一个用来存放最长上升子序列的vector, 由题意可知此vector是升序的，假设当前数为 cur,

vector 中的最大数为 max, 现在决定 cur以何种规则插入vector，如果cur > max,

直接插入vector中；否则，在vector中查找第一个比 cur 大的数 tmp，并用cur 替换 tmp，

按照这种规则得到的vector就是所求解。

#include <vector>
#include <iostream>
using std::vector;
using std::cout;
using std::cin;
using std::endl;

int lcs(int arr[], int num)
{
    vector<int> vec;
    vec.push_back(arr[0]);
    for (int i = 1; i < num; ++i)
    {
        int sz = vec.size();
        if (arr[i] > vec[sz-1])
            vec.push_back(arr[i]);
        else
        {    
            int bgn = 0, end = sz - 1;
            int mid = 0;
            while (bgn <= end)
            {
                     mid = (bgn+end)/2;
                     if (arr[i] > vec[mid])
                            bgn = mid+1;    
                     else
                           end  = mid-1;   
            }
            vec[bgn] = arr[i];
        }
    }
    return vec.size();
}

int main(int argc, char* argv[])
{
    int num;
    cin >> num;
    int *arr = new int[num];
    for (int i = 0; i < num; ++i)
        cin >> arr[i];
    cout << lcs(arr, num) << endl;
    delete []arr;
    arr = NULL;
    return 0;
}