向量距离问题:对于给定的m 个整数m a , a , ,a 1 2  组成的向量A， a m i | |£ ，1 £ i £ m，和另一个由

n个整数n b ,b , ,b 1 2  组成的向量B， b n i | |£ ，1 £ i £ n，试设计一个O(m + n)时间算法，

计算给定向量A和B的距离。-Vector distance problem: For a given m integers ma, a,, a 1 2 　vector composed of A, ami | | £ , 1 £　i £　m, and another by the n-integer nb, b,, b 1 2 　vector composed of B, bni | | £ , 1 £　i £　n, try to design a O (m+ n) time algorithm to calculate the amount of A and B to the targeted distance.