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)
its now giving time limit exceed error…
whats the complexity of your algo
is a tutorial or any other such thing availabe on codechef for the RMQ