摘要:题目描述:给定一张图,问从1和n相遇的最短时间。这道题的输入比较特殊,不能直接存,所以怎么输入,怎么存取,只要可以访问到一个节点的相邻节点就可以,由于spfa算法的时间复杂度为m*n,而Dijkstra算法的时间复杂度为m*log(n),其实Dijkstra就是用优先队列替换掉了spfa中的普通队列...
阅读全文
摘要:题目描述:在一张图中求出有多少对这样的点满足a关系?a:相连并且路径上直接相连的两个点的边的权值小于给定的某个值,假设是x因为询问不确定,所以可以先读取询问操作,按照我们想要的方式回答,然后按照原始顺序输出。相连并且直接相连的每条边的权值小于x的点为一个集合,在这个集合中满足条件的点对有A(2,5)...
阅读全文
摘要:Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14577Accepted Submissio...
阅读全文
摘要:Walk OutTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1977Accepted Submission(s): 373Problem Des...
阅读全文
摘要:FriendsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1192Accepted Submission(s): 595Problem Desc...
阅读全文
摘要:Problem 2150 Fire GameAccept: 693Submit: 2657 Time Limit: 1000 mSecMemory Limit : 32768 KBProblem DescriptionFat brother and Maze are playing a kind o...
阅读全文
摘要:N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11505Accepted Submission(s): 5112Problem Desc...
阅读全文
摘要:Valid Pattern LockTime Limit: 2 Seconds Memory Limit: 65536 KBPattern lock security is generally used in Android handsets instead of a password. Th...
阅读全文
摘要:SuperbotTime Limit:2 Seconds Memory Limit:65536 KBSuperbotis an interesting game which you need to control the robot on anN*Mgrid map.As you see, it's...
阅读全文
摘要:参考:http://blog.csdn.net/shuangde800/article/details/7987100Foyed算法(动态规划):i,j之间的最短路要么直接相连,要么通过一系列其他的点。设为从到的只以集合中的节点为中间节点的最短路径的长度。 //状态的定义十分重要,要想清楚,不然搞死...
阅读全文