记忆化搜索
newhonor
可以不伟大,但不能卑微
展开
-
Zipper
http://acm.hdu.edu.cn/showproblem.php?pid=1501题意:给出三个串,问是否第三个能用前两个表示,且他们的顺序不变,可以打乱;思路:dfs: 要记忆化搜索,标记s1,s2完成了匹配的位置vis[cnt1][cnt2],因为值两个位置前无论再怎么组合都可以匹配出两个串的两部分; dp:dp[i][j]=true,表示s1前i...原创 2019-03-26 19:41:51 · 527 阅读 · 0 评论 -
NB群友
https://ac.nowcoder.com/acm/contest/625/A题意:求一个数数z字(不包含0,1)的积在[l,r]的数有多少;思路:相当于把一个数能分成2-9乘积的种数;dfs记忆化搜索;#include<algorithm>#include<set>#include<vector>#include<queue&g...原创 2019-04-16 18:39:18 · 100 阅读 · 0 评论 -
Function Run Fun POJ - 1579
https://cn.vjudge.net/problem/POJ-1579思路:记忆化搜索;#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <map>#...原创 2019-08-08 22:52:06 · 114 阅读 · 0 评论 -
Zipper
http://acm.hdu.edu.cn/showproblem.php?pid=1501#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>#include <map>#inc...原创 2019-08-09 10:02:36 · 240 阅读 · 0 评论 -
Free Candies UVA - 10118
https://cn.vjudge.net/problem/UVA-10118#include <iostream>#include <cmath>#include <cstring>#define ll long longusing namespace std; int dp[45][45][45][45];int top[5];i...原创 2019-08-09 20:56:08 · 153 阅读 · 0 评论 -
Explosion Exploit Gym - 101933E
https://vjudge.net/problem/Gym-101933E#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include ...原创 2019-10-03 16:13:34 · 181 阅读 · 0 评论