https://www.cosefinch.com/categories/%E6%99%AE%E5%8F%8A-/ Recent content in 普及- on 敲代码的朱雀 Hugo -- gohugo.io zh-cn Fri, 08 May 2026 10:52:25 +0800 https://www.cosefinch.com/posts/p1596-lake-counting/ Fri, 08 May 2026 10:52:25 +0800 https://www.cosefinch.com/posts/p1596-lake-counting/ 八连通 Flood Fill：DFS 洪水填充标记每个水坑，统计连通块数量 https://www.cosefinch.com/posts/p1331-sea-battle/ Fri, 08 May 2026 10:40:45 +0800 https://www.cosefinch.com/posts/p1331-sea-battle/ 通过 2×2 方格特判排除船只接触的非法布局，再用连通性原理计数每艘船的左上基准格 https://www.cosefinch.com/posts/p1003-carpet/ Fri, 08 May 2026 09:55:10 +0800 https://www.cosefinch.com/posts/p1003-carpet/ 按编号从大到小枚举地毯，找到第一个覆盖目标点的地毯即为答案 https://www.cosefinch.com/posts/p1079-vigenere-cipher/ Fri, 08 May 2026 09:47:35 +0800 https://www.cosefinch.com/posts/p1079-vigenere-cipher/ 根据密钥和密文，利用 Vigenère 密码的解密规则还原明文 https://www.cosefinch.com/posts/p1010-power-of-two/ Wed, 06 May 2026 23:00:00 +0800 https://www.cosefinch.com/posts/p1010-power-of-two/ 通过递归将正整数分解为2的幂次方之和，并按特定格式输出 https://www.cosefinch.com/posts/p1116-train-carriage-rearrangement/ Wed, 06 May 2026 22:44:00 +0800 https://www.cosefinch.com/posts/p1116-train-carriage-rearrangement/ 通过冒泡排序模拟相邻交换过程，统计将车厢按编号从小到大排序所需的最少交换次数 https://www.cosefinch.com/posts/p1049-box-packing/ Tue, 05 May 2026 20:44:06 +0800 https://www.cosefinch.com/posts/p1049-box-packing/ 用尽量少的箱子装物品，每个箱子容量固定 m，求最小剩余空间，本质是容量为 m 的 0-1 背包。 https://www.cosefinch.com/posts/p1616-crazy-herb-picking/ Tue, 05 May 2026 11:47:45 +0800 https://www.cosefinch.com/posts/p1616-crazy-herb-picking/ 每种草药可以无限次采摘的完全背包问题，通过正序遍历实现状态转移，求在规定时间内采药的最大总价值。 https://www.cosefinch.com/posts/p1009-sum-of-factorial/ Tue, 05 May 2026 09:55:39 +0800 https://www.cosefinch.com/posts/p1009-sum-of-factorial/ 求 1! + 2! + ... + n! 的值，n 可达 50，需要使用高精度计算。 https://www.cosefinch.com/posts/p1048-herbal-medicine/ Tue, 05 May 2026 09:35:56 +0800 https://www.cosefinch.com/posts/p1048-herbal-medicine/ 在 T 时间内采若干株药，每种药只能采一次，求最大总价值。经典 0-1 背包模板题。 https://www.cosefinch.com/posts/p1002-crossing-river-pawn/ Mon, 04 May 2026 22:41:57 +0800 https://www.cosefinch.com/posts/p1002-crossing-river-pawn/ 在 n×m 棋盘上避开马的控制点，从 (0,0) 到 (n,m) 的路径数，只能向右或向下走。 https://www.cosefinch.com/posts/p1008-triple/ Mon, 04 May 2026 15:58:00 +0800 https://www.cosefinch.com/posts/p1008-triple/ 将1~9分成三组组成三个三位数，使它们满足1:2:3的比例，枚举所有可能的排列找出全部解。 https://www.cosefinch.com/posts/p1216-number-triangle/ Mon, 04 May 2026 14:32:00 +0800 https://www.cosefinch.com/posts/p1216-number-triangle/ 从顶部出发，每次只能走到下一行相邻的位置，求路径上数字之和的最大值。经典 DP 入门题，可用记忆化递归或自底向上递推两种思路解决。