Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

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 = {b₁, b₂,..., b_n} and each block b_i is associated with two parameters (l_i, m_i). 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, l_i and m_i. In other words, a game box is just a collection of n blocks B = {b₁, b₂,..., bn} and each block b_i is associated with two parameters (l_i, m_i).

Note that n can be as large as 10000 and l_i and m_i 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
*

---

二維的沒辦法換成一維的 nlogn 的方法去做，因此用了以下的方法去做。
O(100*100)

#include <stdio.h>
#define max(x,y) ((x)>(y)?(x):(y))
int main() {
    int n;
    while(scanf("%d", &n) == 1 && n) {
        int l, m, i, j;
        int dp[101][101] = {}, used[101][101] = {};
        for(i = 0; i < n; i++)
            scanf("%d %d", &l, &m), used[l][m]++;
        for(i = 1; i <= 100; i++) {
            for(j = 1; j <= 100; j++) {
                dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                dp[i][j] += used[i][j];
            }
        }
        printf("%d\n", dp[100][100]);
    }
    puts("*");
    return 0;
}