HDU

题目大意：棋子要从 star 跳到 end，每个位置都有一个值，要求每次移动时值都递增，且不能返回，把 star 看作无穷小， end 看作无穷大，输出最大和。
解题思路：LIS 水过 dp 记录到达当前位置时最大和

#include<iostream>#include<stdio.h>#include<algorithm>#include<cmath>#include<string.h>#include<string>#include<queue>#include<map>#define max(a,b) ((a)>(b)?(a):(b))#define min(a,b) ((a)<(b)?(a):(b))const int INF = 0x3f3f3f3f;const int NINF = -INF -1;const int MAXN = 1000+5;using namespace std;int num[MAXN], dp[MAXN];int n, ans;int main() {    while (scanf("%d", &n) && n) {        memset(dp, 0, sizeof(dp));        for (int i = 0; i < n; i++)            scanf("%d", &num[i]);        dp[0] = num[0];        ans = 0;        for (int i = 1; i < n; i++) {            dp[i] = num[i];            for (int j = 0; j < i; j++)                if (num[j] < num[i])                    dp[i] = max(dp[j]+num[i], dp[i]);//          printf("%d %d\n", i, dp[i]);            if (dp[i] > ans) ans = dp[i];        }        printf("%d\n", ans);    }    return 0;}