Description
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.
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//注意是严格单调上升。。我之前二分查找的时候多了个等号。。贡献了一个WA擦擦擦。。。
#include <iostream> #include <cstdio> using namespace std; #define maxn 1008 int d[maxn]; int g[maxn]; int A[maxn]; int binary_search(int l,int r,int key) { while(l<r) { int mid=(l+r)/2; if(g[mid]>=key) { r=mid; } else l=mid+1; } return l; } int main() { int n; while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) { scanf("%d",&A[i]); } memset(g,0x3f,sizeof(g)); int maxlen=0; for(int i=1;i<=n;i++) { int k=binary_search(1,n,A[i]); d[i]=k; maxlen=k>maxlen?k:maxlen; g[k]=A[i]; } cout<<maxlen<<endl; } return 0; }