Can someone please give me some hints to solve this problem. Thanks in Advance!!
Read more…(14 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)
[ALTSEQ] Alternating Sequencesby Swetanjal Datta
[SUMSUM] Enjoy Sum with Operationsby Priyam Kakati
Need idea: Tried to solve it using bitmask + segment tree, but getting WA. Any idea about how to solve this problem efficiently?
Read more…(23 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.