摘要： 利用THxxBGM.exe提取，2~3遍loop的th10 BGM。种子在这里：http://www.cnblogs.com/Files/FancyMouse/東方風神録　～%20Mountain%20of%20Faith%20BGM%20[th10]%20torrent.rar寒假里一般能保证开种。以上。 阅读全文

摘要： Exercises 8.1-3 Show that there is no comparison sort whose running time is linear for at least half of the n! inputs of length n. What about a fraction of 1/n of the inputs of length n? What about a ... 阅读全文

摘要： Problems 7-3 Stooge sort Professors Howard, Fine, and Howard have proposed the following "elegant" sorting algorithm: STOOGE-SORT(A,i,j) 1 if A[i] > A[j] 2 then exchange A[i] A[j] 3 if i+1 >= j 4 the... 阅读全文

摘要： Exercises 6.4-3 What is the running time of heapsort on an array A of length n that is already sorted in increasing order? What about decreasing order? See 6.4-5 6.4-5 Show that when all elements are... 阅读全文

摘要： Exercises 5.2-4 Given a permutation A, What is the expected number of indices i such that A[i] = i? The answer is amazingly a constant, 1. Lemma 5.1 The probablity of the permutation that no number is... 阅读全文

摘要： FAQ about the Master theorem Q1: Why in case 1, f(n) must be polynomially smaller than n^log(b,a)? Recall the lemma proved in the proof of the master theorem i.e. for T(n) = a*T(n/b) + f(n) T(n) = Θ(n... 阅读全文

摘要： Exercises 3.1-4 Is 2^(n+1) = O(2^n)? Is 2^2n = O(2^n)? Yes. No. 3.1-7 Prove that o(g(n)) ∩ ω(g(n)) is the empty set. Assuming that there is a function f(n) ∈o(g(n)) ∩ ω(g(n)) then f(n) ∈o(g(n)) ,f(n)... 阅读全文

摘要： Exercises 2.2-4 How can we modify almost any algorithm to have a good best-case running time? CHEAT. Is there any OIer who can not cheat? That's O(1). 2.3-6 Can we use a binary search instead to impr... 阅读全文

摘要： 暂且没有得到我被减分的消息……那姑且作为偶的oi生涯400分光荣退役的一个纪念，给大家呈上一份偶个人的题解 阅读全文

摘要： 这是一个老问题……希望对那些不幸遇到的朋友有点帮助当然，这里的前提是：主板、硬盘（光驱）都支持DMA，驱动程序安装正确，启用了DMA模式但是仍然在低速DMA或PIO下运行的情况。问题的产生：在Windows 2000/XP/2003中有这样一个设定： Windows IDE/ATAPI 端口驱动程序 (Atapi.sys) 累积收到总共6个超时或循环冗余检验(CRC)错误后... 阅读全文