I already read some posts before...but I still don't understand why the ouputs like this.
For example:
Input:3 2 Output: 1 5
Input:2 1 Output: 1 3
Input:3 3 Output: 1 5
where
Input: height of initial cat # of worker cat
Output: # of cats not working height of the stack of cats
why?
Thanks in ...
Search found 4 matches
- Fri Oct 04, 2002 9:22 am
- Forum: Volume 1 (100-199)
- Topic: 107 - The Cat in the Hat
- Replies: 278
- Views: 54877
- Fri Sep 27, 2002 8:56 am
- Forum: Volume 1 (100-199)
- Topic: 103 - Stacking Boxes
- Replies: 200
- Views: 50269
- Wed Sep 25, 2002 9:22 pm
- Forum: Volume 1 (100-199)
- Topic: 103 - Stacking Boxes
- Replies: 200
- Views: 50269
prob 103 - dynamic programming
To solve problem 103, some people said on the board about DP (Dynamic Programming).
How DP is used? Can anyone give me an example?
Thanks.
How DP is used? Can anyone give me an example?
Thanks.
- Sat Sep 21, 2002 7:45 am
- Forum: Volume 1 (100-199)
- Topic: 103 - Stacking Boxes
- Replies: 200
- Views: 50269
Please Help P103...
Hi,
I try to solve this problem in these steps:
1) sort the numbers for each row
2) find the longest path
I know how to do the first step, but I have no clue how to achieve the second step. In my mind, i think i need to use DFS...but how? How can I connect the arrays (assume i am using two ...
I try to solve this problem in these steps:
1) sort the numbers for each row
2) find the longest path
I know how to do the first step, but I have no clue how to achieve the second step. In my mind, i think i need to use DFS...but how? How can I connect the arrays (assume i am using two ...