POJ1887 Testing the CATCHER

要点：
1.即求最大下降子序列，可以直接将数组倒过来用求最大上升子序列的算法
2.如何用-1结束程序一开始没理解，题意就是每组开始时如果第一个输入的是-1就跳出
3.这题数据比较水，用n^2的也能过，不过为了充分理解我把两种都写一遍

一：O(n^2)

#include<stdio.h>
int main()
{
    int a[50000],dp[50000];
    int i, j,n,t,num=0;
    while (scanf("%d", &t), t!= -1)
    {    //判断每组的第一个输入是否为-1
        int max = 0;
        n = 0;
        a[0] = t;
        while(scanf("%d", &t),t!=-1)
        a[++n] = t;  //每组以-1为结尾
        for (i = 0; i <= n; i++)
            dp[i] = 1;
        for (i = 0; i <= n; i++)
            for (j = i - 1; j >= 0; j--)
            {      //j从i-1开始从后往前寻找，就像找最大上升序列一样
                if (a[i]<a[j] && dp[j] + 1>dp[i])
                    dp[i] = dp[j] + 1;
            }
        for (i = 0; i <= n;i++)
        {
            if (dp[i] > max)
                max = dp[i];
        }
        printf("Test #%d:\n", ++num);
        printf("  maximum possible interceptions: %d\n", max);
        printf("\n");     //输出格式有要求空行
    }
    return 0;
}

二：O（nlogn）
还是一样的思路：把数组反一下直接用lis的模板就行

#include<stdio.h>
int a[50000],dp[50000];
int i, j,n,t,num=0,len;
int lower_bound(int i)  //跟lis一模一样
{
    int left, right, mid;
    left = 0, right = len;
    while (left < right)
    {
        mid = left + (right - left) / 2;
        if (dp[mid]>a[i])
            right = mid;
        else
            left = mid + 1;
    }
    return left;
}

int main()
{
    while (scanf("%d", &t), t!= -1)
    {
        n = 1;
        a[1] = t;
        while(scanf("%d", &t),t!=-1)
        a[++n] = t;
        dp[1] = a[n];
        len = 1;
        for (i = n; i >= 1; i--)  //这里把数组从后往前做就行
        {
            if (a[i] > dp[len])
                dp[++len] = a[i];
            else
            {
                int pos = lower_bound(i);
                dp[pos] = a[i];
            }
        }
        printf("Test #%d:\n", ++num);
        printf("  maximum possible interceptions: %d\n", len);
        printf("\n");
    }
    return 0;
}