https://blog.kyee.top/通天塔个人博客. 2026-06-19T21:06:59+08:00 Yi Yao https://blog.kyee.top/ Jekyll © 2026 Yi Yao /assets/img/favicons/favicon.ico /assets/img/favicons/favicon-96x96.png 简述一类 Subset Sum 问题2025-09-03T00:00:00+08:00 2025-09-03T00:00:00+08:00 https://blog.kyee.top/posts/%E7%AE%80%E8%BF%B0%E4%B8%80%E7%B1%BB-Subset-Sum-%E9%97%AE%E9%A2%98/ Yi Yao 对于物品大小最大为 $V$ 的 Subset Sum 问题可以做到 $\mathrm{O}(nV)$ 的时间复杂度, 而传统背包 DP 解法只能做到 $\mathrm{O}(n^2V)$. SG 定理与反常游戏2025-07-20T00:00:00+08:00 2025-07-20T00:00:00+08:00 https://blog.kyee.top/posts/SG-%E5%AE%9A%E7%90%86%E4%B8%8E%E5%8F%8D%E5%B8%B8%E6%B8%B8%E6%88%8F/ Yi Yao SG 定理的理论基础, 反常游戏在竞赛中的应用.