HDU 1087 Super Jumping! Jumping! Jumping!(基础DP)

题目链接：点击打开链接

题意：求最大公共子序列和

// HDU 1087 Super Jumping! Jumping! Jumping!.cpp 运行/限制：31ms/1000ms#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;int main(){int n, re, a[1005], dp[1005];while (scanf("%d", &n) != EOF && n) {re = -1;for (int i = 0; i < n; i++) {scanf("%d", &a[i]);}for (int i = 0; i < n; i++) {dp[i] = a[i];for (int j = i - 1; j >= 0; j--) {if (a[i] > a[j]) {dp[i] = max(dp[i], dp[j] + a[i]);}}re = max(re, dp[i]);}printf("%d\n", re);}    return 0;}