Suppose we are given two increasing arrays A and B , we need to find max((a[j]-a[i-1] )- (b[j]-b[i-1])) , where j>=i .

Can we solve it in better than O(n^2) time complexity . If so , please give me any Hint .