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.
Input
The first line of input file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
7 1 7 3 5 9 4 8
Sample Output
4
题意:求最长递增子序列。
思路:利用二分加快dp速度
#include<iostream>
#include<string.h>
using namespace std;
const int INF = 1<<28;
const int MAX = 1005;
int num[MAX];
int low[MAX]; //low[i]表示长度为i的递增子序列末尾的最小值
int solve(int n)
{
for (int i = 0; i < n; i++)
low[i] = INF;
low[0] = num[0];
int cnt = 1;
for (int i = 1; i < n; i++)
{
int l = 0, r = cnt;
while (l < r)
{
int mid = (l + r) / 2;
if (low[mid] > num[i])
r = mid;
else if (low[mid] < num[i])
l = mid + 1;
else
{
l = mid;
break;
}
}
if (l == cnt)
low[cnt++] = num[i];
else
low[l] = num[i];
}
return cnt;
}
int main()
{
int N;
while (cin >> N)
{
for (int i = 0; i < N; i++)
cin >> num[i];
cout << solve(N) << endl;
}
return 0;
}