------------------基本算法和排序----------------
文章平均质量分 89
UMR小豪
这个作者很懒,什么都没留下…
展开
-
poj 3279 Fliptile
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15原创 2017-05-17 11:13:18 · 275 阅读 · 0 评论 -
poj 3279 Pots
B - Pots Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description You are given two pots, having the volume of A and B liters respectively原创 2016-07-23 10:52:44 · 286 阅读 · 0 评论 -
poj3087 Shuffle'm Up
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips.原创 2017-05-17 13:40:33 · 351 阅读 · 0 评论 -
hdu 1034 & poj 1077 Eight 传说中的八数码问题。真是一道神题,A*算法+康托展开
博主表示比较懒,说明什么的就直接粘过来啦。 第一个A*搜索,A*是一种启发式搜索,g为已花代价,h为估计的剩余代价,而A*是根据f=g+h作为估价函数进行排列,也就是优先选择可能最优的节点进行扩展。 对于八数码问题,以下几个问题需要知道 1.判断有无解问题:根据逆序数直接判断有无解,对于一个八数码,依次排列之后,每次是将空位和相邻位进行调换,研究后会发现,每次调换,逆转载 2017-05-17 20:02:23 · 603 阅读 · 0 评论