置换群
文章平均质量分 84
没有能与不能只有想与不想
这个作者很懒,什么都没留下…
展开
-
UVA Arif in Dhaka (First Love Part 2) 10294 (polya定理)
Arif in Dhaka (First Love Part 2)Our hero Arif is now in Dhaka (Look at problem 10244 – First Love if you want to know more aboutArif, but that information is not necessary for this problem. In shor原创 2016-03-02 10:39:49 · 516 阅读 · 0 评论 -
poj Cow Sorting 3270 (置换群)好题
Cow SortingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6661 Accepted: 2600DescriptionFarmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked原创 2016-03-01 22:04:09 · 594 阅读 · 0 评论 -
poj Necklace of Beads 1286 (polya定理)置换群
Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7454 Accepted: 3103DescriptionBeads of red, blue or green colors are connected together i原创 2016-03-02 10:56:55 · 357 阅读 · 0 评论 -
LA 3641 - Leonardo's Notebook(置换群)
3641 - Leonardo's Notebook— I just bought Leonardo’s secret notebook! Rare objectcollector Stan Ucker was really agitated but his friend,special investigator Sarah Keptic was unimpressed.— How do原创 2016-03-02 13:21:53 · 396 阅读 · 0 评论 -
UVA Find the Permutations 11077 (DP&置换群)
Find the PermutationsSorting is one of the most used operations in real life, where Computer Science comes into act. It iswell-known that the lower bound of swap based sorting is nlog(n). It means t原创 2016-03-02 14:02:59 · 302 阅读 · 0 评论 -
LightOJ - 1166 Old Sorting (置换群)
LightOJ - 1166Old SortingTime Limit: 2000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit StatusDescriptionGiven an array containing a permutation of 1 to n,原创 2016-04-21 08:36:49 · 394 阅读 · 0 评论