Can u explain the question in a better way?

#1

i am unable to understand what the author is meaning to tell

There should be some explanation for the test cases
#2

see these statements

bridge starting from the ith end point on one side can only end on the ith end point on the other side
2.The tribe just wants to make as many non-cutting bridges as possible, with the constraint in mind.
for 1st test:
4
2 5 8 10
6 4 1 2
ans is 2 because of (1,8) and (2,10)
for explanation refer this image

bridge

So you need to find Longest increasing subsequence in both arrays.
This is an implementation in case you have further doubts https://ide.codingblocks.com/s/280668

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.