
搜索
冰可乐小朋友
把事情想简单些,或许就会开心些
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
第K短路(A*)
给定一张N个点(编号1,2…N),M条边的有向图,求从起点S到终点T的第K短路的长度,路径允许重复经过点或边。 注意: 每条最短路中至少要包含一条边。 输入格式 第一行包含两个整数N和M。 接下来M行,每行包含三个整数A,B和L,表示点A与点B之间存在有向边,且边长为L。 最后一行包含三个整数S,T和K,分别表示起点S,终点T和第K短路。 输出格式 输出占一行,包含一个整数,表示第K短路的长度,如...原创 2019-10-27 22:46:44 · 517 阅读 · 0 评论 -
Saving Tang Monk II HihoCoder - 1828(BFS)
《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming Dynasty. In this novel, Monkey King Sun Wukong, pig ...原创 2019-09-03 21:27:54 · 159 阅读 · 0 评论 -
Sticks UVA - 307(dfs)
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had orig...原创 2019-09-11 22:10:23 · 146 阅读 · 0 评论