LIS HDOJ 1257 最少拦截系统

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;

const int MAXN = 1e4 + 10;
const int INF = 0x3f3f3f3f;
int a[MAXN];
int dp[MAXN];
int n;

void LIS() {
    memset (dp, 0, sizeof (dp));
    int ans = 0;
    for (int i=1; i<=n; ++i)    {
        dp[i] = 1;
        for (int j=1; j<i; ++j) {
            if (a[i] > a[j] && dp[i] < dp[j] + 1)    {
                dp[i] = dp[j] + 1;
            }
        }
        ans = max (ans, dp[i]);
    }
    printf ("%d
", ans);
}

int main(void)  {
    while (scanf ("%d", &n) == 1)   {
        for (int i=1; i<=n; ++i)    scanf ("%d", &a[i]);
        LIS ();
    }

    return 0;
}