MBLHQ的博客

递归:递归是指某个函数直接或间接的调用自身。问题的求解过程就是划分成许多相同性质的子问题的求解，而小问题的求解过程可以很容易的求出，这些子问题的解就构成里原问题的解。  例如，二分中常用的寻找根节点的递归： int  find（int x）{ return x==per[x]?x:(per[x]=find(per[x]); } hdu--red and black #include c

Description I was trying to solve problem '1234 - Harmonic Number', I wrote the following code long long H( int n ) {     long long res = 0;     for( int i = 1; i  n; i++ )         res = res

Quoit Design Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41828    Accepted Submission(s): 10871 Problem Description Have you e