最长上升子序列（模板）

Stock Exchange
The world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He follows stock prices every day looking for rising trends. Given a sequence of numbers p1, p2,…,pn representing stock prices, a rising trend is a subsequence pi1 < pi2 < … < pik, with i1 < i2 < … < ik. John’s problem is to find very quickly the longest rising trend.
Input
Each data set in the file stands for a particular set of stock prices. A data set starts with the length L (L ≤ 100000) of the sequence of numbers, followed by the numbers (a number fits a long integer).
White spaces can occur freely in the input. The input data are correct and terminate with an end of file.
Output
The program prints the length of the longest rising trend.
For each set of data the program prints the result to the standard output from the beginning of a line.
输入
6
5 2 1 4 5 3
3
1 1 1
4
4 3 2 1
输出
3
1
1
There are three data sets. In the first case, the length L of the sequence is 6. The sequence is 5, 2, 1, 4, 5, 3. The result for the data set is the length of the longest rising trend: 3.
下面这个代码对于这题会超时

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int f[N], mx[N], siz[N], st[N];
int w[N], v[N], a[N], b[N];
int main()
{
    int n, m, i, j, k, sum, t;

    while (cin >> n)
    {
        sum = 0;

        for (int i = 1; i <= n; i++)
        {
            cin >> a[i];
        }
        for (int i = 1; i <= n; i++)
        {
            f[i] = 1;
            for (int j = 1; j <= i; j++)
            {
                if (a[j] < a[i])
                {
                    f[i] = max(f[i], f[j] + 1);
                }
            }
            sum = max(sum, f[i]);
        }
        cout <<sum << '\n';
    }
    return 0;
}

二分优化版

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int f[N], mx[N], siz[N], st[N];
int w[N], v[N], a[N], b[N];
int main()
{

    int n, m, i, j, k, sum, t;

    sum = 0;
    while (cin >> n)
    {
        for (i = 1; i <= n; i++)
        {
            cin >> a[i];
        }
        vector<int> v;

        v.clear();
        for (i = 1; i <= n; i++)
        {
            if (i == 1)
                v.push_back(a[i]);
            else
            {
                if (a[i] > v.back())
                    v.push_back(a[i]);
                else
                {
                    int num = lower_bound(v.begin(), v.end(), a[i]) - v.begin();
                    v[num] = a[i];
                }
            }
        }
        cout << v.size() << endl;
    }
    return 0;
}