Miss.Zhou
Miss.Zhou
全部文章
—搜索
###基本算法(~ o ~)Y(1)
.net(1)
2014多校联合(2)
acm(12)
arcgis(1)
bfs(1)
c#(1)
c++(1)
CF(2)
codeforces(5)
css(1)
dp(27)
git使用(1)
hdu(27)
java(1)
javascript(4)
LeetCode(47)
leetcode (1)
lightoj(1)
oi(1)
php(12)
poj(13)
poj 搜索 算法 acm(1)
poj 算法 线段树 懒惰标记(1)
python(2)
RMQ(1)
socket(1)
splay(1)
tarjan(3)
trie(3)
vmware(1)
web开发(1)
xml(1)
—dp(9)
—STL(2)
———哈希表(2)
———网络流(1)
—二分(2)
—图论(7)
—字符串(4)
—思维题(1)
—数据结构(5)
—数论(9)
—贪心(4)
三分(1)
二分图(3)
前端(1)
动态规划(1)
匈牙利算法(1)
博弈(1)
压缩(1)
双连通分量(1)
图论(4)
多校(2)
并查集(1)
并查集 poj(1)
并查集 几何 hdu(1)
并查集 算法(2)
广搜(2)
思维题(1)
拓扑排序(1)
搜素(1)
搜索(1)
操作系统(2)
数据结构(1)
数论 算法(3)
最佳二分匹配(1)
最大二分匹配(2)
最小树形图(1)
未归档(397)
杭电(7)
树型dp(2)
模拟(1)
欧拉回路(1)
正则表达式(1)
深搜(1)
深搜 hdu 算法(1)
矩阵(1)
算法(10)
算法 并查集(1)
线段树(6)
编程(1)
网络流(4)
计算机基础(4)
设计模式(19)
贪心(1)
随笔(1)
题解(8)
验证码(1)
归档
标签
去牛客网
登录
/
注册
MissZhou的小窝
六年磨一剑~
全部文章
/ —搜索
(共7篇)
hdu5025Saving Tang Monk【广搜】
Description 《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Ch...
2016-03-24
0
662
hdu5040Instrusive【广搜】
Problem Description The legendary mercenary Solid Matt gets a classic mission: infiltrate a military base. The military base can be seen as an...
2016-03-19
0
681
Codeforces 405 E. Graph Cutting 【DFS 】
Description Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his skills to the fullest. Chris ...
2016-03-17
0
606
hdu2295Radar [dancing links重复覆盖]
Problem Description N cities of the Java Kingdom need to be covered by radars for being in a state of war. Since the kingdom has M radar stations ...
2016-03-06
0
809
zoj3209Treasure Map【dancing links】
Description Your boss once had got many copies of a treasure map. Unfortunately, all the copies are now broken to many rectangular pieces, and w...
2016-03-01
0
630
poj2286The Rotation Game【深搜IDA*】
Description The rotation game uses a # shaped board, which can hold 24 pieces of square blocks (see Fig.1). The blocks are marked with symbols 1, 2...
2016-02-28
0
598
hdu1010Tempter of the Bone深搜剪枝
感冒还没还利索,脑子不怎么转个,尤其是这半周没好好刷题愧疚得导致今天早上4点就醒了==一上午也才研究明白这么一个,不过弄懂了奇偶剪枝我还是很开心的 简单的说,奇偶剪枝根据未走步子和规定步数的奇偶关系减少循环次数的。说的有点迷糊,拿这个题来说要求只能走T步,从当前点到终点的步数要和剩余能走的步数奇偶...
2015-07-08
0
450