Midnightkwai

分类

ACM之路(320) KMP(11) 二分(2) 二叉树(1) 动态规划(19) 博弈(2) 大数(4) 差分(1) 并查集(3) 搜索(23) 数学几何(25) 数据结构(127) 最大匹配(3) 最小生成树(7) 最短路(9) 未归档(100) 枚举(14) 模拟(8) 水题(23) 清欢渡总结(5) 线段树(2) 规律(6) 贪心(9) 递推(5) 题解(1)

/ 注册

全部文章（共31篇）

POJ - Hopscotch(DFS)

题目链接:http://poj.org/problem?id=3050Time Limit: 1000MS Memory Limit: 65536K Description The cows play the child's game of hopscotch in a non-traditio...

DFS STL set 搜索

2019-07-24

0 778

POJ - Pots(BFS+打印路径)

题目链接:http://poj.org/problem?id=3414Time Limit: 1000MS Memory Limit: 65536K Description You are given two pots, having the volume of A and B liters r...

BFS 搜索 STL

2019-07-25

0 553

HDU - Find a way(BFS)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2612Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Descripti...

BFS 搜索 STL

2019-07-25

0 492

OpenJudge - 鸣人和佐助(BFS)

题目链接:http://bailian.openjudge.cn/practice/4115?lang=en_US总时间限制: 1000ms 内存限制: 65536kB 描述佐助被大蛇丸诱骗走了，鸣人在多少时间内能追上他呢？已知一张地图（以二维矩阵的形式表示）以及佐助和鸣人的位置。地图...

BFS STL 搜索

2019-07-25

0 960

POJ - Meteor Shower(BFS)

题目链接:http://poj.org/problem?id=3669Time Limit: 1000MS Memory Limit: 65536K Description Bessie hears that an extraordinary meteor shower is coming; r...

搜索 STL BFS

2019-07-26

0 544

POJ - 昂贵的聘礼(最短路)

题目链接:http://poj.org/problem?id=1062Time Limit: 1000MS Memory Limit: 10000K Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答...

最短路 STL Spfa Dijkstra

2019-07-26

0 670

POJ - ROADS(搜索)

题目链接:http://poj.org/problem?id=1724Time Limit: 1000MS Memory Limit: 65536K Description N cities named with numbers 1 ... N are connected with one-wa...

DFS BFS 深搜广搜 STL

2019-07-29

0 547

POJ - Arctic Network(最小生成树)

题目链接:http://poj.org/problem?id=2349Time Limit: 2000MS Memory Limit: 65536K Description The Department of National Defence (DND) wishes to connect se...

prim STL queue 最小生成树

2019-08-14

0 650

POJ - Agri-Net(最小生成树)

题目链接:http://poj.org/problem?id=1258Time Limit: 1000MS Memory Limit: 10000K Description Farmer John has been elected mayor of his town! One of his ca...

prim STL 最小生成树

2019-08-14

0 524

POJ - Constructing Roads(最小生成树)

题目链接:http://poj.org/problem?id=2421Time Limit: 2000MS Memory Limit: 65536K Description There are N villages, which are numbered from 1 to N, and you...

prim STL 最小生成树

2019-08-14

0 633