Given a graph $ G(V,E)$ with $ n$ vertices labeled $ 1,2,…n$ and $ m$ positively weighted edges $ (u,v,w)$ with the condition that $ u<v,$ $ \forall u,v \in G$ , so the graph we are considering is actually a DAG. We need to find an odd path from $ 1$ to $ n$ that have the smallest weight median. i.e when the weights on the path are listed and sorted, the median of that list should be minimal.
Is it possible to solve this problem without enumerating all possible odd paths while maintaining a running median?
I have been trying to solve this problem for a couple of days and got stuck and solutions are not posted on the website.
Problem source: Problem G
✓ Extra quality
ExtraProxies brings the best proxy quality for you with our private and reliable proxies
✓ Extra anonymity
Top level of anonymity and 100% safe proxies – this is what you get with every proxy package
✓ Extra speed
1,ooo mb/s proxy servers speed – we are way better than others – just enjoy our proxies!
USA proxy location
We offer premium quality USA private proxies – the most essential proxies you can ever want from USA
Our proxies have TOP level of anonymity + Elite quality, so you are always safe and secure with your proxies
Use your proxies as much as you want – we have no limits for data transfer and bandwidth, unlimited usage!
Superb fast proxy servers with 1,000 mb/s speed – sit back and enjoy your lightning fast private proxies!
99,9% servers uptime
Alive and working proxies all the time – we are taking care of our servers so you can use them without any problems
No usage restrictions
You have freedom to use your proxies with every software, browser or website you want without restrictions
Perfect for SEO
We are 100% friendly with all SEO tasks as well as internet marketing – feel the power with our proxies
Buy more proxies and get better price – we offer various proxy packages with great deals and discounts
We are working 24/7 to bring the best proxy experience for you – we are glad to help and assist you!