![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
DP,记忆化搜索
文章平均质量分 80
老年退役选手
BAT打工人
展开
-
HDOJ1978 How many ways 记忆化搜索入门题
How many ways Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5726 Accepted Submission(s): 3382 Problem Description 这是一个简单的生存游戏,原创 2017-08-11 09:17:15 · 355 阅读 · 0 评论 -
HDOJ1078 记忆化搜索入门题 有详细的记忆化搜索模板程序
FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10863 Accepted Submission(s): 4625 Problem Description FatMo原创 2017-08-11 10:18:33 · 1782 阅读 · 0 评论 -
HDOJ1428 BFS+DFS 记忆化搜索裸题
漫步校园 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4505 Accepted Submission(s): 1421 Problem Description LL最近沉迷于AC不能自拔,每天寝室、机房原创 2017-08-11 15:41:34 · 435 阅读 · 0 评论 -
HDOJ 入门级深搜DFS 题目汇总,持续更新中,一路打怪升级
声明:以下题目均来自于HDOJ,题目难度并没有排序,都是很基础的题目。DFS:http://acm.hdu.edu.cn/showproblem.php?pid=1455http://acm.hdu.edu.cn/showproblem.php?pid=2553http://acm.hdu.edu.cn/showproblem.php?pid=1426http://acm.hdu.edu.cn/sh原创 2017-08-12 08:08:53 · 444 阅读 · 0 评论 -
HDOJ2571 DP入门题(DP+DFS)
命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20325 Accepted Submission(s): 7081Problem Description 穿过幽谷意味着离大魔王lemon已经无限接近了! 可谁能想到,yif原创 2017-08-21 17:24:34 · 313 阅读 · 0 评论 -
HDOJ1208 记忆化搜索水题
Pascal’s TravelsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2575 Accepted Submission(s): 1221Problem Description An n x n game board is原创 2017-08-21 21:25:13 · 228 阅读 · 0 评论 -
HDOJ3022 记忆化搜索
Sum of Digits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 783 Accepted Submission(s): 211 Problem Description Petka thought原创 2017-10-29 23:00:03 · 262 阅读 · 0 评论 -
UVA11468 AC自动机+记忆化搜索
题意:给定一些字符及其各自对应的选择概率,随机选择L次后将得到一个长度为L的随机字符串S(每次独立随机)。给出K个模板串,计算S不包含任何一个串的概率(即任意一个模板串都不是S的连续子串) 分析: 构造AC自动机,每次随机生成一个字母,相当于在AC自动机随机走一步。所以有单词标记的结点标记为“禁止”。本题就是求从结点0走L步,不进入任何禁止结点的概率。 假设d(i,j)表示在当前结点原创 2017-10-22 17:12:38 · 229 阅读 · 0 评论 -
SPOJ 3923 BYTESM2 - Philosophers Stone
One of the secret chambers in Hogwarts is full of philosopher’s stones. The floor of the chamber is covered by h × w square tiles, where there are h rows of tiles from front (first row) to back (last原创 2017-12-02 14:56:09 · 190 阅读 · 0 评论