设X[0:n-1]和Y[0:n-1]为两个数组，每个数组中都有n个已经排好序的数字，试设计一个O（logn）时间的算法，找出X和Y的2n个数的中位数。-Set X [0: n-1] and Y [0: n-1] for the two arrays, each array has n good order have been ranked the number and try to design a O (logn) time algorithm to find of the X and Y i

* Frequency domain filtering -1. Discrete Fourier Transform Write a C++ function for each of following: (a) Multiply the input image by (-1)x+y to center the transform for filtering. (b) Compute the two-dimensional discrete F

pb中实现图片的多种播放效果,并且实现以下多种变化 01由下往上,02 由左往右,03 x向百叶,04 由右往左,05 y向百叶, 06 垂直中开,07 水平中开,08 直接播放,09 由下往上(停顿), 10 跑马灯,11 跑马灯(停顿),12 由下往上(停顿),13 逐字显示, 14 多行跑马灯,15 上下对拼,16 左右对拼,17 矩形框向右上, 18 矩形框向左下,19 矩形框向内,20 矩形框向外,21 从中菱形打开, 22 从外菱形打开,23 时针式打开,24