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
#include <stdio.h> int zhan[1000]; int main() { int n,a,l,top; scanf("%d",&n); top=0; zhan[0]=-1; //第一个元素可能为0,所以栈底设为-1 for(int i=0; i<n; i++) { scanf("%d",&a); if(a>zhan[top]) { zhan[++top]=a; } else { int low=1,high=top; //栈的最底端是1,最上面是top int mid; while(low<=high) //利用二分法 查找在栈中比a大的第一个数 { mid=(low+high)/2; if(a>zhan[mid]) { low=mid+1; } else { high=mid-1; } } zhan[low]=a; //找到了就替换啊 } } printf("%d\n",top); //top是最顶端的,top是几 就代表那个序列多长 return 0; }