2012年3月30日

HDU 1027 Ignatius and the Princess II （产生第m大的排列，STLmap中的next_permutation(array,array+n);）

摘要： Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2272Accepted Submission(s): 1371Problem DescriptionNow our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty P 阅读全文

posted @ 2012-03-30 00:47 kuangbin 阅读(689) 评论(0) 推荐(0) 编辑

C++STL的next_permutation

摘要： C++STL的next_permutation在标准库算法中,next_permutation应用在数列操作上比较广泛.这个函数可以计算一组数据的全排列.但是怎么用,原理如何,我做了简单的剖析.首先查看stl中相关信息.函数原型:template<class BidirectionalIterator> bool next_permutation( BidirectionalIterator _First, BidirectionalIterator _Last );template<class BidirectionalIterator, class BinaryPredi 阅读全文

posted @ 2012-03-30 00:44 kuangbin 阅读(10459) 评论(3) 推荐(6) 编辑

HDU 1026 Ignatius and the Princess I （BFS+优先队列，记录路径）

摘要： Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5989Accepted Submission(s): 1816Special JudgeProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess 阅读全文

posted @ 2012-03-30 00:29 kuangbin 阅读(1358) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: