CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
[LVADER] Luke vs Darth Vaderby Himanshu Jaju
courier-the courierby Aishwarya Aishwarya
can anyone help me with courier problem-the courier
Read more…(8 words)
[RENT] Rent your airplane and make moneyby Himanshu Jaju
This problem is from ACM Southwestern European Regional Contest, Paris 2003
Read more…(11 words)
[BAT2] Batman2by Annu Purohit
Need idea: I thought of finding all possible increasing and decreasing subsequences which is too slow. Can this be done efficiently? Also according to me there can be at max 1 element in common in both the subsequences. I am not getting how to use this information.