Totally stucked in MONSTER after 10 points even shorten range of x which actually ~~nedd ~~need to be processed to 131072(2^17) and precomputed all x from 0 to 131072 with given n still stucked.and HUMONGOUS QUERY is good question use of dp to compute subsequences of sequences and then flip. I computed sequences in optimal time but flipping create hurdle then finally i have to use brutforce for flipping and satisfy in 15 only without that dp sequences finding 15 is also not possible.i have one complain only ~~ssme ~~some brutforce solution of killkth give me 5 marks in java but 20 marks in python using list comprehension...(maybe because i found that inbuilt substring method in java take linear time instead of constant time like in ~~python~~python).