POJ1609:Tiling Up Blocks(DP)

Description

Michael The Kid receives an interesting game set from his grandparent as his birthday gift. Inside the game set box, there are n tiling blocks and each block has a form as follows:

Each tiling block is associated with two parameters (l,m), meaning that the upper face of the block is packed with l protruding knobs on the left and m protruding knobs on the middle. Correspondingly, the bottom face of an (l,m)-block is carved with l caving
dens on the left and m dens on the middle.

It is easily seen that an (l,m)-block can be tiled upon another (l,m)-block. However,this is not the only way for us to tile up the blocks. Actually, an (l,m)-block can be tiled upon another (l‘,m‘)-block if and only if l >= l‘ and m >= m‘.

Now the puzzle that Michael wants to solve is to decide what is the tallest tiling blocks he can make out of the given n blocks within his game box. In other words, you are given a collection of n blocks B = {b1, b2, . . . , bn} and each block bi is associated
with two parameters (li,mi). The objective of the problem is to decide the number of tallest tiling blocks made from B.

Input

Several sets of tiling blocks. The inputs are just a list of integers.For each set of tiling blocks, the first integer n represents the number of blocks within the game box. Following n, there will be n lines specifying parameters of blocks in B; each line
contains exactly two integers, representing left and middle parameters of the i-th block, namely, li and mi. In other words, a game box is just a collection of n blocks B = {b1, b2, . . . , bn} and each block bi is associated with two parameters (li,mi).

Note that n can be as large as 10000 and li and mi are in the range from 1 to 100.

An integer n = 0 (zero) signifies the end of input.

Output

For each set of tiling blocks B, output the number of the tallest tiling blocks can be made out of B. Output a single star ‘*‘ to signify the end of

outputs.

Sample Input

3
3 2
1 1
2 3
5
4 2
2 4
3 3
1 1
5 5
0

Sample Output

2
3
*

Source

Asia Kaohsiung 2003

题意：有几个积木，每个积木上面有凸起，下面有凹进去的部分，左边凸起与凹进去的个数都一样，是L，中间也一样，是M

对应的两个金木能堆起来，当且仅当L1>=L2&&M1>=M2，问最多能堆多高

思路，简单DP，dp[i][j] = max(dp[i-1][j],dp[i][j-1])+cnt[i][j];

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
#define ls 2*i
#define rs 2*i+1
#define up(i,x,y) for(i=x;i<=y;i++)
#define down(i,x,y) for(i=x;i>=y;i--)
#define mem(a,x) memset(a,x,sizeof(a))
#define w(a) while(a)
#define LL long long
const double pi = acos(-1.0);
#define Len 200005
#define mod 19999997
const int INF = 0x3f3f3f3f;

int dp[105][105];
int cnt[105][105];
int n,x,y,i,j,k;

int main()
{
    w(~scanf("%d",&n)&&n)
    {
        mem(dp,0);
        mem(cnt,0);
        up(i,0,n-1)
        {
            scanf("%d%d",&x,&y);
            cnt[x][y]++;
        }
        up(i,1,100)
        {
            up(j,1,100)
            dp[i][j] = max(dp[i-1][j],dp[i][j-1])+cnt[i][j];
        }
        printf("%d\n",dp[100][100]);
    }
    printf("*\n");

    return 0;
}