You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hint 1
Think if y cannot be small. You can solve a query in O(n/y), so if y is large enough, it won't be a problem.
Hint 2
If y is small, like less than B, you can preprocess the answers for all such ys in O(n * B), then answer each such query in O(1).
Hint 3
As you might have already guessed, the optimal value for B is ~sqrt(n).