郑州升达经贸管理学院-17级-孔鑫

分类

ACM(6) ACM算法题(26) AC自动机(2) DP(9) JAVA(6) KMP(10) 二分匹配(3) 划水(3) 博弈(3) 大数(2) 并查集(8) 广搜(4) 散知识(1) 最小生成树(7) 最短路(6) 未归档(51) 深搜(8) 蓝桥杯(3) 贪心(3)

/ 注册

全部文章（共161篇）

POJ - 1679 The Unique MST （最小生成树）

The Unique MST Description Given a connected undirected graph, tell if its minimum spanning tree is unique. Def...

2018-07-31

0 388

POJ - 2349 Arctic Network （最小生成树）

Arctic Network Description The Department of National Defence (DND) wishes to connect several northern outpo...

2018-07-31

0 393

POJ - 1789 Truck History （最小生成树）

Truck History Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are ...

2018-07-31

0 414

POJ - 1258 Agri-Net （最小生成树）

Agri-Net Description Farmer John has been elected mayor of his town! One of his campaign promises was ...

2018-07-31

0 386

POJ - 1751 Highways （最小生成树 Kruskal、Prim）

Highways Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very...

2018-07-31

0 302

POJ - 2031 Building a Space Station （最小生成树）

Building a Space Station Description You are a member of the space station engineering team, and are assigned a tas...

2018-07-31

0 280

POJ - 3026 Borg Maze （广搜+最小生成树 prim）

Borg Maze Description The Borg is an immensely powerful race of enhanced humanoids from the delta quadr...

2018-07-30

0 394

HDU - 1102 Constructing Roads (最小生成树 prim)

Constructing Roads Problem Description There are N villages, which are numbered from 1 to N, and you should bu...

2018-07-30

0 356

最短路算法理解

最短路算法理解对于最短路的学习，主要学习了弗洛伊德Floyd算法、迪杰斯特拉Dijkstra算法、Bellman-Ford算法、自己又在网上看了一些spfa求最短路；对于Bellman-Ford的队列优化建立邻接表自己没...

2018-07-28

0 403

博弈问题

博弈问题巴什博弈：只有一堆n个物品，两个人轮流从这堆物品中取物，规定每次至少取一个，最多取m个。最后取光者得胜。显然，如果n=m+1，那么由于一次最多只能取m个，所以，无论先取者拿走多少个，后取者都能够一次...

2018-07-28

0 345