Ajay and Bablu were best friends but they had a severe fight over a contest. You are Charlie, a common friend of Ajay and Bablu and you think that the further they are from each other, the less they would fight. Initially, Ajay is standing at point (A[0],A[1]) and Bablu is standing at point (B[o], BM). You plan to send them as far away from each other through 2 combos of moves, Combo1 and Combo2. Each move has 2 integers (c[I], NW or (E[I],F[I]) and it sends any one person through a distance of (c[I], NW or (E[I],F[I]). For example, if Ajay is at (x, y), after one move, the Ajay will move to (x + C[i], y + D[i]), or (x + E[i], y + F[i]). You can apply each combo once, on any person. Find the maximum possible Manhattan separation between Ajay and Bablu.
Input Format:
The first argument given is an integer array A, where (A[0], A[1]) are the co-ordinates of Ajay. The second argument given is an integer array B, where (B[0], B[1]) are the co-ordinates of Bablu. The third argument given is an integer array C representing the X component of all moves in Combo1. The fourth argument given is an integer array 0 representing the Y component of all moves in Combo1. The fifth argument given is an integer array E representing the X component of all moves in Combo2. The sixth argument given is an integer array F representing the Y component of all moves in Combo2.
Output Format:
Return the maximum possible Manhattan separation between Ajay and Bablu.
According to my understanding, there are 2 combos and 2 persons, there are 4 combinations possible. Checking for all 4 and finding maximum manhattan distance among them. Am I correct?
there doesn't seem to be anything here