Longest Ordered Subsequence与最少拦截系统 DP+贪心（最长上升子序列及最少序列个数）

#include<stdio.h>
#include<string.h>

int f[1005],a[1005];

int max(int x,int y)
{
    return x>y?x:y;
}

int main()
{
    int n,i,j;
    scanf("%d",&n);
    memset(a,0,sizeof(a));
    memset(f,0,sizeof(f));
    for(i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    f[1]=1;
    for(i=2;i<=n;i++){
        for(j=1;j<i;j++){
            if(a[j]<a[i]){
                f[i]=max(f[i],f[j]);
            }
        }
        f[i]++;
    }
    int ans=0;
    for(i=1;i<=n;i++){
        ans=max(ans,f[i]);
    }
    printf("%d\n",ans);
    return 0;
}

#include<stdio.h>
#include<string.h>

int a[10005];

int main()
{
    int n,x,c,i,j;
    while(~scanf("%d",&n)){
        c=1;
        memset(a,0,sizeof(a));
        a[1]=30001;
        for(i=1;i<=n;i++){
            scanf("%d",&x);
            for(j=1;j<=c;j++){
                if(a[j]>=x){
                    a[j]=x;
                    break;
                }
                if(j==c){
                    a[++c]=x;
                    break;
                }
            }
        }
        printf("%d\n",c);
    }
    return 0;
}