Test instructions
For n two-tuple (a, b), in which the longest sequence is found, making any i<j in the sequence Ai<=aj and BI<=BJ.
Analysis:
Set Dp[a][b] represents the longest sequence length at (a) end, and a mnemonic search is available.
Code:
POJ 1609//sep9#include <iostream>using namespace Std;const int max_p=128;int n;int num[max_p][max_p];int Dp[max _p][max_p];int search (int x,int y) {if (Dp[x][y]) return dp[x][y];int i,j,maxx=0;for (i=1;i<=x;++i) for (j=1;j<=y;+ +J) if (! ( i==x&&j==y)) if (Num[i][j]) Maxx=max (Maxx,search (i,j)); return dp[x][y]=maxx+num[x][y];} int main () {while (scanf ("%d", &n) ==1) {if (n==0) {printf ("*\n"); int Max_l=0,max_m=0;memset (num,0,sizeof (num)), memset (Dp,0,sizeof (DP)), for (int i=0;i<n;++i) {int a,b;scanf ("%d%d ", &a,&b); ++num[a][b];max_l=max (max_l,a); Max_m=max (max_m,b);} int I,j,ans=0;for (i=1;i<=max_l;++i) for (j=1;j<=max_m;++j) if (Num[i][j]) Ans=max (Ans,search (i,j));p rintf ("%d\ N ", ans);} return 0;}
POJ 1609 Tiling up Blocks DP Getting started memory search