hdu 1087 LIS 最长递增子序列的值

Input
Input contains multiple test cases. Each test case is described in a line as follow:
N value_1 value_2 …value_N
It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.
A test case starting with 0 terminates the input and this test case is not to be processed.

Output
For each case, print the maximum according to rules, and one line one case.

Sample Input
3 1 3 2
4 1 2 3 4
4 3 3 2 1
0

Sample Output
4
10
3

题解：

一道LIS的水题，注意求的是值，不是长度，模板上都是求的是长度。

代码：

#include <bits/stdc++.h>using namespace std;const int maxn = 1000+10;int a[maxn]={0};int dp[maxn];int main(){    int n;    while(scanf("%d",&n)!=EOF)    {        if(n==0) break;        for(int i=1;i<=n;i++)        {            scanf("%d",&a[i]);        }        memset(dp,0,sizeof(dp));        for(int i=1;i<=n;i++)        {            for(int j=0;j<i;j++)            {                if(a[i]>a[j])                {                    dp[i]=max(dp[i],dp[j]+a[i]);                }            }        }        int* pos = max_element(dp+1,dp+n+1);        cout<<*pos<<endl;    }    return 0;}