
递归递推
文章平均质量分 69
OtterVV
这个作者很懒,什么都没留下…
展开
-
递归递推 URAL1081 递归
1081. Binary Lexicographic SequenceTime limit: 0.5 secondMemory limit: 64 MBConsider all the sequences with length (0 < N < 44), containing only the elements 0 and 1, and no two ones are ad...原创 2018-07-30 00:13:22 · 196 阅读 · 0 评论 -
递归递推 ZOJ1633
Big StringTime Limit: 2 Seconds Memory Limit: 65536 KBWe will construct an infinitely long string from two short strings: A = "^__^" (four characters), and B = "T.T" (three characters). Repea...原创 2018-07-30 00:26:33 · 282 阅读 · 0 评论 -
递归递推 G HDU1207 汉诺塔2
汉诺塔IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10085 Accepted Submission(s): 4918 Problem Description经典的汉诺塔问题经常作为一个递归的经典例题存在。可能...原创 2018-07-30 22:39:20 · 283 阅读 · 0 评论 -
DP POJ1019 递推&二分(思想)
Number SequenceTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 42304 Accepted: 12331 DescriptionA single positive integer i is given. Write a program to find the dig...原创 2018-08-04 21:54:30 · 250 阅读 · 0 评论 -
树状数组 POJ2299&HDU6318 逆序对 离散化树状数组&归并排序
逆序对i<j时,a[i]>a[j],则(a[i],a[j])为逆序对。求解方法有两种:1)离散化树状数组 很多时候a[i]>>n,这时候就需要离散化,给序列编号。 具体理解:i为序列1~n,a[i]为初始序列,编号index[i]则为a[i]应该处于的位置;sum求得index[i]前及其自身出现过的数字,i-sum()为小于inde...原创 2018-08-13 22:42:58 · 211 阅读 · 0 评论 -
Codeforces Round #533 (Div. 2) C递推 D有趣有毒的BFS
第一次还是第二次打CF,太有趣了!切水题的能力太弱,暴力过题,暴力是美丽的艺术~AB暴力过,想的太慢。 C递归递推莽就完了,然而我一直在想数学统计的方法orz…C. Ayoub and Lost Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard ...原创 2019-01-21 21:25:08 · 347 阅读 · 0 评论