update on BreakTheCode 2015 -Noisy Gtbit



the update for the ques Noisy Gtbit is not yet available, but it is been announced on the contest


It is available right now.

Note: If two or more index have minimum number of students then print the largest index.

This enabled me to get accepted.


This question was based on RMQ.
Time complexity for building tree is O(n) and for query it is O(logn)

  1. Topcoder Tutorial on RMQ,
  2. GeeksforGeeks Tutorial on RMQ.

Hope it helps :slight_smile:


its now giving time limit exceed error… :frowning:
whats the complexity of your algo


is a tutorial or any other such thing availabe on codechef for the RMQ