Problem in Bridges

#1

Please help me find the mistake in the solution.
Also please explain the question.i dont understand the meaning of: The ith point on one side should map to the only ith point on the other?

#2

Hey correction is on line 30 : if(arr[i].first >= arr[j].first && arr[i].second >= arr[j].second)
Btw u dont have to add 1st condition as u already sorted the array.

And

this means that ith index element of 1st array is starting position and ith index index element of 2nd element is ending position for ith bridge.

#3

still getting the wrong ans

#4

Please share your code again & please recheck once because with the change I mentioned your code is working perfectly on my side.

#5

I applied the logic as: first sort the array acc to one side then find the longest increasing subsequence from other side

#6

@abhir26 share your code again.

#7

@abhir26 your Logic is correct.

#8

here is the code link

#9
#10

Hey @abhir26
U haven’t done the changes I suggested
line 30 should be if( arr[i].second >= arr[j].second)
You also have to consider equal elements

#11

Ohh sorry I forgot to put = sign in condition. Thanks for resolving!

1 Like