New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[問題案]Static RMQ(staticrmq) #34
Comments
クエリが完全にランダムだとブロック分割で容易に<O(n), O(1)>が達成できてしまうので、幅の小さいクエリばっかのケースを用意する |
It is amusing to see that O(1) sparse table solution has the same time as O(log n) iterative segment tree. |
We need O(N log N) time for constructing the sparse table and N = Q in this problem... |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
No description provided.
The text was updated successfully, but these errors were encountered: