Results of Comment Search
Title | User | Message | Date Posted |
---|---|---|---|
Easily doable with Q up to 200K | kobortor | The problem allows queries in O(logN), or even O(1) if you try hard enough, so I'm not sure why N and M are so high while Q is so low. | Jul 15, 2017 - 1:23:23 am UTC |