Poj 2533 & poj 1631 longest ordered subsequence (LIS results)

Question link:

Poj 2533: http://poj.org/problem? Id = 2533

Poj 1631: http://poj.org/problem? Id = 1631

Description

A numeric sequence AIIs 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 other 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

71 7 3 5 9 4 8

Sample output

4

Source

Northeastern Europe 2002, far-Eastern subregion

Lis results.

The Code is as follows:

#include <cstdio>#include <iostream>#include <algorithm>int N;int ans;int a[1017], dp[1017];int  bin(int len, int tem){    int l = 1, r = len;    while(l <= r)    {        int mid = (l+r)/2;        if(tem > dp[mid])            l = mid+1;        else            r = mid-1;    }    return l;}int LIS(int *b){    dp[1] = a[1];    ans = 1;    int k;    for(int i = 2; i <= N; i++)    {        if(a[i] < dp[1])            k = 1;        else if(a[i] > dp[ans])            k = ++ans;        else            k = bin(ans,a[i]);        dp[k] = a[i];    }    return ans;}int main(){    while(~scanf("%d",&N))    {        for(int i = 1; i <= N; i++)        {            scanf("%d",&a[i]);        }        LIS(a);        printf("%d\n",ans);    }    return 0;}

Poj 1631 is basically the same as this question. You only need to change the array size to a multi-test case input loop!

The Code is also posted here:

#include <cstdio>#include <iostream>#include <algorithm>int N;int ans;int a[40017], dp[40017];int  bin(int len, int tem){    int l = 1, r = len;    while(l <= r)    {        int mid = (l+r)/2;        if(tem > dp[mid])            l = mid+1;        else            r = mid-1;    }    return l;}int LIS(int *b){    dp[1] = a[1];    ans = 1;    int k;    for(int i = 2; i <= N; i++)    {        if(a[i] < dp[1])            k = 1;        else if(a[i] > dp[ans])            k = ++ans;        else            k = bin(ans,a[i]);        dp[k] = a[i];    }    return ans;}int main(){    int t;    scanf("%d",&t);    while(t--)    {        scanf("%d",&N);        for(int i = 1; i <= N; i++)        {            scanf("%d",&a[i]);        }        LIS(a);        printf("%d\n",ans);    }    return 0;}

Poj 2533 & poj 1631 longest ordered subsequence (LIS results)