eazo的博客

定义 设 A 为一个有 n 个数字的有序集 (n>1)，其中所有数字各不相同。 如果存在正整数 i, j 使得 1 ≤ i < j ≤ n 而且 A[i] > A[j]，则 <A[i], A[j]> 这个有序对称为 A 的一个逆序对，也称作逆序数。 求解方法 1.暴力枚举 利用两重循环进行枚举。该算法的时间复杂

题目描述 We have N clocks. The hand of the i-th clock (1≤i≤N) rotates through 360° in exactly Ti seconds. Initially, the hand of every clock stands still, pointing directly upward. Now, Dolphin starts all...

题目描述 When you were five years old, you watched in horror as a spiked devil murdered your parents. You would have died too, except you were saved by Rose, a passing demon hunter. She ended up adopting ...