- 最後登錄
- 2022-10-5
- 在線時間
- 2 小時
- 註冊時間
- 2016-5-1
- 閱讀權限
- 20
- 精華
- 0
- UID
- 16387415
- 帖子
- 22
- 積分
- 47 點
- 潛水值
- 4070 米
| 1.What is the time complexity of algorithm for the order statistic problem if seven elements aregrouped instead of five?
2. Consider a stick of length m meters that has to be cut at s1, s2, …, and sn meters from left end, wherem and si are all integers and the cut order of si can be any permutation. The cost of each cut si is the lengthof stick prior to the cut , and thus different permutation of cut order leads to different cost.Illustrate a dynamic programming algorithm for finding the minimum cut cost of a stick of length 40,which will be cut at 5, 7, 13, 29, 32, and 37 meters from left end. You should write down the recurrence,bottom-up computation, and the entire solution by backtracking. ... |
|