poj2533-----E[j]=opt{D+w(i,j)} 类型板子题

最长公共子序列，做板子用：

#include <iostream>#include <cstdio>using namespace std;const int maxn = 1001;const int INF = 1e30;int a[maxn], n;int dp[maxn];int main(){//freopen("input.txt", "r", stdin);    while(~scanf("%d", &n)) {for(int i = 1; i <= n; i++) {scanf("%d", &a[i]);dp[i] = 1;}for(int i = 1; i <= n; i++) {for(int j = 1; j < i; j++) {if(a[j] < a[i])dp[i] = max(dp[i], dp[j] + 1);}}int ans = -INF;for(int i = 1; i <= n; i++)ans = max(ans, dp[i]);printf("%d\n", ans);    }    return 0;}