摘要:
Set algorithm Sometimes we may meet with some functions \(S\rightarrow V\)(S is a set,V is a value),and we need to handle some transformations on it. 阅读全文
摘要:
Fail to become GM. Hints are omitted. \(O(nmh^2)\) is too simple,just use dynamic programming. \(dp(i,j,k)\) means the probability to reach the goal i 阅读全文