hdu1087 Super Jumping! Jumping! Jumping!

解题思路：最大递增序列，动态规划

状态转移方程：d[i] = max(d[j]+a[i]) (0<j<i && a[i]>a[j])

AC代码：

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

#define clr(p,v) memset(p,v,sizeof(p))
const int maxn = 1010 ;

int n, ans;
int a[maxn], d[maxn];

int main()
{
    while (~scanf("%d", &n) && n)
    {
        //Input
        for (int i=0; i<n; ++i)
        {
            scanf("%d", &a[i]);
            d[i] = a[i];
        }
        //Calculate
        for (int i=1; i<n; ++i)
        {
            for (int j=i-1; j>=0; --j)
            {
                if (a[j] < a[i])
                    d[i] = max(d[i], d[j]+a[i]);
            }
        }
        //find
        ans = d[0];
        for (int i=1; i<n; ++i)
            ans = max(ans, d[i]);
        //output
        printf("%d\n", ans);
    }
    return 0;
}