hdu 1087 最大递增和

思路和LIS差不多，dp[i]为i结尾最大值

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <cctype>
#include <vector>
#include <iterator>
#include <set>
#include <map>
#include <sstream>
using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))
#define pf printf
#define sf scanf
#define spf sprintf
#define pb push_back
#define debug printf("!\n")
#define MAXN 205
#define MAX(a,b) a>b?a:b
#define blank pf("\n")
#define LL long long
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pqueue priority_queue
#define INF 0x3f3f3f3f

int n,m;

int dp[],v[];

int main()
{
    int i,j,k,a,b,kase=;
    while(~sf("%d",&n) && n)
    {
        mem(dp,);
        mem(v,);
        int ans = ;
        for(i=;i<n;i++)
        {
            sf("%d",&v[i]);
            dp[i] = v[i];
            ans = max(ans,dp[i]);
        }
        for(i=;i<n;i++)
        {
            for(j=;j<i;j++)
            {
                if(dp[i]>dp[j])
                {
                    dp[i] = max(dp[i],dp[j]+v[i]);
                    ans = max(dp[i],ans);
                }
            }
        }
        pf("%d\n",ans);
    }
    return ;
}