kuangbin专题十二 HDU1087 Super Jumping! Jumping! Jumping!

传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1087

题目大意：给出一个序列，求严格上升子序列的最大和。

看到题目，发现是之前做过的题目，但是读了题之后，发现不是普通的，（可能是状态不好，就不想做了）。dp[i] 表示 以 i 结尾的最大和。

状态转移方程：dp[i] = max(a[i], max{dp[j] | 0 <= j < i, a[j] < a[i])} + a[i]) 

AC代码：

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
using namespace std;
#define mem(a,b) memset((a),(b),sizeof(a))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define forn(i, x, n) for(int i = (x); i < n; i++)
#define nfor(i, x, n) for(int i = n-1; i >= x; i--)
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF =0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
const double eps = 1e-5;
const ll mod = 1e9+7;
int a[1010], dp[1010]; 

int main() {
	int n;
	while(~scanf("%d", &n), n) {
		forn(i, 0, n) {
			scanf("%d", &a[i]);
		}
		int ans;
		forn(i, 0, n) {
			ans = -inf;
			forn(j, 0, i) {
				if(a[j] < a[i])//找最大的dp[j] 
					ans = max(dp[j], ans);
			}
			dp[i] = max(a[i], ans + a[i]);//dp[i]
		}
		ans = -inf;
		forn(i, 0, n) {
			ans = max(ans, dp[i]);
		}
		printf("%d\n", ans);
	}
}

 

复杂的AC代码（同时记录最长长度）：

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
using namespace std;
#define mem(a,b) memset((a),(b),sizeof(a))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define forn(i, x, n) for(int i = (x); i < n; i++)
#define nfor(i, x, n) for(int i = n-1; i >= x; i--)
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF =0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
const double eps = 1e-5;
const ll mod = 1e9+7;
int a[1010], dp[1010], w[1010];

int main() {
	int n;
	while(~scanf("%d", &n), n) {
		forn(i, 0, n) {
			scanf("%d", &a[i]);
			w[i] = a[i];
		}
		int maxx = -1;
		forn(i, 0, n) {
			dp[i] = 1;
			int temp = w[i];//因为下面会改变w[i] 的 值 
			forn(j, 0, i) {
				if(a[j] < a[i] && dp[j] + 1 > dp[i]) {
					dp[i] = dp[j] + 1;//dp存的是最长严格上升序列 
					if(temp + w[j] > w[i])
						w[i] = temp + w[j];//以i结尾的最大和 
				}
			}
			maxx = max(w[i], maxx);
		}
		printf("%d\n", maxx);
	}
}