HDU Super Jumping! Jumping! Jumping!（LIS）

题目链接

知识点：LIS

思路：与最长升序子序列思路基本一致，只不过dp[i]记录的是a[1]~a[i-1]的升序子序列和的最大值+a[i]

代码：

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int a[1005], dp[1005];
int main()
{
    int N;
    while (~scanf("%d", &N))
    {
        if (N == 0)
            break;
        memset(dp, 0, sizeof(dp));
        for (int i = 1; i <= N; i++)
        {
            scanf("%d", &a[i]);
            dp[i] = a[i];
        }
        for (int i = 2; i <= N; i++)//填dp数组
        {
            int tmp = 0;
            for (int j = 1; j <= i - 1; j++)//找出a[1]~a[i-1]比a[i]小的dp[j]的最大值
                if (a[j] < a[i])
                    tmp = max(tmp, dp[j]);
            dp[i] += tmp;//更新dp
        }
        int res = 0;
        for (int i = 1; i <= N; i++)//找出dp数组中的最大值
            res = max(res, dp[i]);
        cout << res << endl;
    }
    return 0;
}