记忆化搜索
等我学会后缀自动机
侠影之谜
展开
-
UVA 1252 Twenty Questions (记忆化搜索+DP状压)*
Consider a closed world and a set of features that are defined for all the objects in the world. Each feature can be answered with “yes” or “no”. Using those features, we can identify any object from ...原创 2018-08-14 10:20:21 · 132 阅读 · 0 评论 -
HDU 5602 Black Jack (记忆化搜索+DP)*
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5602 #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll lon...原创 2018-10-19 06:44:42 · 185 阅读 · 0 评论 -
CodeForces - 82D Two out of Three (记忆化搜索+DP)*
题目链接:http://codeforces.com/problemset/problem/82/D #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll long...原创 2018-11-13 18:39:01 · 312 阅读 · 0 评论 -
HDU 3920 Clear all of them (状态压缩+记忆化搜索)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3920 #include <algorithm> #include <iostream> #include<cmath> #include<cstring> #include<stdio.h> #define maxn 30 #define...原创 2019-01-22 15:03:55 · 146 阅读 · 0 评论 -
HDU 5637 Transform (DFS+记忆化搜索+位运算)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5637 #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++) #define ll lon...原创 2019-02-05 22:06:56 · 110 阅读 · 0 评论 -
Codeforces Round #197 (Div. 2) C. Xenia and Weights(记忆化搜索+map+DP)
题目链接:http://codeforces.com/problemset/problem/339/C 开个三维映射的map直接爆搜即可,记忆化下状态一共是1e7这样的级别 #include<bits/stdc++.h> using namespace std; #define debug puts("YES"); #define rep(x,y,z) for(int (x...原创 2019-04-23 21:11:27 · 87 阅读 · 0 评论