DFS
Timeclimber
这个作者很懒,什么都没留下…
展开
-
poj 1088 滑雪(DFS+记忆化搜索)
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 100183 Accepted: 38112DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡原创 2017-08-14 01:01:30 · 316 阅读 · 0 评论 -
hdu 2553 N皇后问题(dfs)
N皇后问题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 27849 Accepted Submission(s): 12359Problem Description在N*N的方格棋盘放置了N个皇后,使得它们不原创 2018-01-17 11:10:03 · 256 阅读 · 0 评论 -
nefu 1330 树上计算 (dfs序+树状数组)
树上计算Problem:1330Time Limit:1000msMemory Limit:65535KDescription给出一棵以 1 为根的树,初始每个顶点的权值为 0 。现有两种操作: 1 x 代表将顶点 x 的权值加一 2 x 询问顶点 x 的子原创 2018-02-01 13:13:00 · 483 阅读 · 0 评论 -
hdu 5113 Black And White (dfs+剪枝)
Black And WhiteTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 5284 Accepted Submission(s): 1452Special JudgeProblem Description原创 2018-01-17 18:21:55 · 231 阅读 · 0 评论 -
zoj 3826 Hierarchical Notation(hash+dfs)
Hierarchical NotationTime Limit: 2 Seconds Memory Limit: 131072 KBIn Marjar University, students in College of Computer Science will learn EON (Edward Object Notation), which is a原创 2018-01-26 18:29:51 · 231 阅读 · 0 评论 -
NEFU 1300 染色(dfs)
染色Problem:1300Time Limit:1000msMemory Limit:65535KDescription给你一棵有n个顶点的有根树。顶点编号从1到n,根是顶点编号1。每个顶点都有一个颜色,让我们用Cv来表示顶点v的颜色。最初Cv = 0。您必须使用尽可能少的步骤将树着色原创 2018-01-20 16:03:03 · 260 阅读 · 0 评论 -
hdu 3974 Assign the task(dfs序+线段树)
Assign the taskTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4270 Accepted Submission(s): 1746Problem DescriptionThere is a company that h...原创 2018-03-10 16:06:59 · 194 阅读 · 0 评论 -
ACM-ICPC 2018 沈阳赛区网络赛 J. Ka Chang(分块+树状数组+dfs序)
Given a rooted tree ( the root is node 11 ) of NN nodes. Initially, each node has zero point.Then, you need to handle QQ operations. There're two types:1\ L\ X1 L X: Increase points by XX of all n...原创 2018-09-11 16:56:50 · 389 阅读 · 0 评论