The problem Traveling Graph seems quite interesting to solve but there is no editorial available thus I cannot understand it on my own and is the reason am asking for help.

Can someone from Codeforces help me reach a bit near to the solution, can u pls share some ideas/approach for this problem.

I cannot understand how bitmasking will be used here, if possible can someone explain that part too.

Can someone give more insights on this ICPC-19 online round problem . I know it requires LIS and prefix sum but I can't develop the idea.

Before writing this blog I have searched for it's answer in ICPC India Online Round 2019 Discussion blog on Codeforces but no one has explained the idea there, thus I have no source to understand it ...

Thanx, regards.