Testing the CATCHER

最长非上升子序列：//注意最后的输出格式！！！

贪心：

<span style="font-size:14px;">#include<stdio.h>
const int Max=10000;
int str[Max+10];
int stack[Max+10];
int bsearch(int num,int top){
    int low=1,high=top;
    while(low<=high){
        int mid=(low+high)/2;
        if(num<=stack[mid])
            low=mid+1;
        else high=mid-1;
    }
    return low;
}
int main(){
    int t;
    int Case=0;
    while(scanf("%d",&t)==1&&t!=-1){
        Case++;
        int cnt=0;
        str[cnt]=t;
        while(scanf("%d",&t)==1&&t!=-1){
            str[++cnt]=t;
        }
        int top=1;
        stack[top]=str[0];
        for(int i=1;i<=cnt;i++){
            if(str[i]<=stack[top])
                stack[++top]=str[i];
            else{
                int pos=bsearch(str[i],top);
                stack[pos]=str[i];
            }
        }
        if(Case==1){
            printf("Test #%d:\n",Case);
            printf("  maximum possible interceptions: %d\n",top);
        }
        else{
            printf("\nTest #%d:\n",Case);
            printf("  maximum possible interceptions: %d\n",top);
        }
    }
}
</span>

<span style="font-size:14px;">#include<stdio.h>
const int Max=10000;
int str[Max+10];
int maxlen[Max+10];
int main(){
    int t;
    int Case=0;
    while(scanf("%d",&t)==1&&t!=-1){
        Case++;
        int cnt=0;
        int ant=0;
        str[cnt]=t;
        while(scanf("%d",&t)==1&&t!=-1){
            str[++cnt]=t;
        }
        for(int i=0;i<=cnt;i++)
            maxlen[i]=1;
        for(int i=1;i<=cnt;i++){
            for(int j=0;j<i;j++){
                if(str[j]>=str[i]&&maxlen[j]+1>maxlen[i])
                    maxlen[i]=maxlen[j]+1;
            }
        }
        for(int i=0;i<=cnt;i++){
            if(maxlen[i]>ant)
                ant=maxlen[i];
        }
        if(Case==1){
            printf("Test #%d:\n",Case);
            printf("  maximum possible interceptions: %d\n",ant);
        }
        else{
            printf("\nTest #%d:\n",Case);
            printf("  maximum possible interceptions: %d\n",ant);
        }
    }
    return 0;
}
</span>