[理工][演算法] 98NCTU
obst
If there are n records and every node has identical access probability,
the cost for the optimal binary is O(nlogn) .
答案給True
我的解法 :
每個點都是 1/n
1/n *1*1 + 1/n*2*2 + 1/n*3*4 + ... + 1/n * logn* 2^(logn-1)
算出來的O(logn)
請問錯在哪 謝謝
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.123.183.52
推
01/10 00:48, , 1F
01/10 00:48, 1F
→
01/10 00:49, , 2F
01/10 00:49, 2F
推
01/10 00:55, , 3F
01/10 00:55, 3F
→
01/10 00:57, , 4F
01/10 00:57, 4F
→
01/10 12:12, , 5F
01/10 12:12, 5F
→
01/10 15:29, , 6F
01/10 15:29, 6F
→
01/10 15:30, , 7F
01/10 15:30, 7F
→
01/10 15:31, , 8F
01/10 15:31, 8F
→
01/10 15:31, , 9F
01/10 15:31, 9F
→
01/10 16:16, , 10F
01/10 16:16, 10F
→
09/11 14:08, , 11F
09/11 14:08, 11F