程序控

IPPP (Institute of Penniless Peasent-Programmer) Fellow
  博客园 :: 首页 :: 新随笔 :: 联系 :: :: 管理 ::

2010年8月17日

UVa OJ 125 - Numbering Paths (路径计数)
摘要： Background背景Problems that process input and generate a simple "yes" or "no" answer are called decision problems. One class of decision problems, the NP-complete problems, are not amenable to general e... 阅读全文
posted @ 2010-08-17 20:01 Devymex 阅读(2284) 评论(5) 推荐(1)

全排列生成算法：next_permutation
摘要： 概念全排列的生成算法有很多种，有递归遍例，也有循环移位法等等。C++/STL中定义的next_permutation和prev_permutation函数则是非常灵活且高效的一种方法，它被广泛的应用于为指定序列生成不同的排列。本文将详细的介绍prev_permutation函数的内部算法。按照STL... 阅读全文
posted @ 2010-08-17 02:37 Devymex 阅读(12213) 评论(13) 推荐(2)

UVa OJ 124 - Following Orders (保持有序)
摘要： Time limit: 3.000 seconds限时：3.000秒Background背景Order is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: "a partially ordered set in which every chain has ... 阅读全文
posted @ 2010-08-17 00:56 Devymex 阅读(1647) 评论(0) 推荐(0)