两个序列a0a_0a0,a1a_1a1,.........,ana_nan和b0b_0b0, b1b_1b1,.........,bnb_nbn,对每个位置求 xn=min(ai+bn−i),(0<=i<=n)x_n = min(a_i + b_{n - i}), (0<= i<=n)xn=min(ai+bn−i),(0<=i<=n) 是否存在O(nlogn)的解法