作者PowerKid (暴力小孩)
看板Prob_Solve
标题[问题] 演算法问题
时间Wed Oct 5 20:41:09 2011
For a given constant c 属於 R,we define the iterated function f by
f(n) = min{i>= 0 :f(i)(n)<=c} (i是在f的上面)
In other words, the quantity f (n) is the number of iterated applications of
t\
he function f required to reduce its
argument down to c or less.
For each of the following function f(n) and constant c, give as tight a bound
as possible on f*c (n).
f(n) c
1. n^1/2 1
2. n^(1/3) 2
3. n/lgn 2
剩下这几题不知道怎麽估i 的bound= =
--
╲ ◢▅◢▅◣ ╱ 亲爱的你要找什麽阿~◢██ ◣◢███◣ 在前面!!!
◤◥◥█◣ ◢◢◢█ █◥◥█◢ 我找到了!
● ● ◤ 为什麽...我的心里 ▏
◢ ● ● ◢◣ 你在这边
─ ◣-- ◢ ─ 会有种蛋蛋的哀伤呢? ◣▽ ◢ ◣▼ ◢ ◢ 等我一下唷~
◢ 马 ◣ ﹑
。 ◢ 驴 ◣◣ ◣
╱ ＜
▂▂▂◣╯
╲ 。 ＜ ▂▂▂▂▂▂▂◣╯
ψQSWEET
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.123.215.39