There are n issues numbered with integers from 1 to n. I-th issue has the intricacy ci=2i, label tagi and score si. In the wake of taking care of the issue I it's permitted to take care of issue j if and provided that IQ<|ci−cj| and tagi≠tagj. Subsequent to settling it your IQ changes and becomes IQ=|ci−cj| and you gain |si−sj| focuses. Any issue can be the
Correct answer will be upvoted else downvoted. Computer science.
There are n issues numbered with integers from 1 to n. I-th issue has the intricacy ci=2i, label tagi and score si.
In the wake of taking care of the issue I it's permitted to take care of issue j if and provided that IQ<|ci−cj| and tagi≠tagj. Subsequent to settling it your IQ changes and becomes IQ=|ci−cj| and you gain |si−sj| focuses.
Any issue can be the first. You can tackle issues in any request and however many occasions as you need.
At first your IQ=0. Track down the greatest number of focuses that can be procured.
Input
The main line contains a solitary integer t (1≤t≤100) — the number of experiments.
The primary line of each experiment contains an integer n (1≤n≤5000) — the number of issues.
The second line of each experiment contains n integers tag1,tag2,… ,tagn (1≤tagi≤n) — labels of the issues.
The third line of each experiment contains n integers s1,s2,… ,sn (1≤si≤109) — scores of the issues.
It's dependable that amount of n over all experiments doesn't surpass 5000.
Output
For each experiment print a solitary integer — the greatest number of focuses that can be procured
Step by step
Solved in 4 steps with 1 images