POJ-1887-Testing the CATCHER-最长递减子序列-DP动态规划

#include <algorithm>
#include <iostream>
using namespace std;

const int MAX_SIZE = 5005;

int a[MAX_SIZE];
int dp[MAX_SIZE];

int main()
{
    int test = 1;
    int temp;
    while(1) {
        cin >> temp;
        if(temp == -1)
            break;

        int n = 0;
        a[0] = temp;
        n++;
        while(1) {
            cin >> temp;
            if(temp == -1)
                break;

            a
 = temp;
            n++;
        }

        for(int i = 0; i < n; i++) {
            dp[i] = 1;
            for(int j = 0; j < i; j++) {
                if(a[j] > a[i] && dp[i] < dp[j] + 1)
                    dp[i] = dp[j] + 1;
            }
        }

        int max_dp = *max_element(dp, dp + n);

        cout << "Test #" << test << ":" << endl;
        cout << "  maximum possible interceptions: " << max_dp << endl;
        cout << endl;
        test++;
    }

    return 0;
}