搜索
关注
分享
扫一扫
Albert_Bolt
这个作者很懒，什么都没留下…
展开
-
杭电1142（dijkstra最短路+DFS记忆化搜索）
A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionJimmy experiences a lot of stress at work these days, especially si...原创 2018-07-18 21:58:52 · 350 阅读 · 0 评论 -
杭电1016（DFS+素数环）
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2,...原创 2018-07-29 16:52:48 · 560 阅读 · 0 评论 -
杭电1104（BFS+特别注意%与mod运算）
Remainder（难度：1）Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionCoco is a clever boy, who is good at mathematics. However, he is puzzled by a d...原创 2018-07-30 11:14:19 · 305 阅读 · 0 评论 -
杭电1111（DFS+复数+秦九韶）
Secret Code（难度：1）Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThe Sarcophagus itself is locked by a secret numerical code. When somebody ...原创 2018-07-30 11:47:50 · 262 阅读 · 0 评论 -
杭电1195（BFS）
Open the LockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionNow an emergent task for you is to open a password lock. The password is consiste...原创 2018-07-31 21:56:31 · 378 阅读 · 0 评论 -
搜索：DFS、BFS
基本概念状态：对问题在某一时刻的进展情况的数学描述状态转移：从一个状态扩展出其他状态的过程搜索树：由若干状态和状态转移形成的树形结构判重：已经搜索过的状态不再进行搜索剪枝：去掉搜索树中不需要的状态和转移深度优先搜索 DFS以递归的方式寻找路径，走不通就返回上一层。时间复杂度：O(xnm)，x为可扩展方式的种数空间复杂度：O(n*m)伪代码框架void...原创 2018-09-04 16:33:48 · 241 阅读 · 0 评论 -
杭电1078（仓鼠吃奶酪，DFS+动态规划）
FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a ...原创 2018-08-02 21:05:46 · 1161 阅读 · 0 评论