We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
今のTreeMapを使ったデータ構造だと、大きさH*Wのマップからある長方形範囲 h*w のオブジェクトN個を抜き出すのに O(log(H) + log(W) + h*w) かかりますが、チャンクを使うと O(h*w) で抜き出しが済みます。かなしい
The text was updated successfully, but these errors were encountered:
と思ったのですが、要素の削除に関しては高速なので直さなくて良い気がしてきました
Sorry, something went wrong.
trpfrog
No branches or pull requests
今のTreeMapを使ったデータ構造だと、大きさH*Wのマップからある長方形範囲 h*w のオブジェクトN個を抜き出すのに O(log(H) + log(W) + h*w) かかりますが、チャンクを使うと O(h*w) で抜き出しが済みます。かなしい
The text was updated successfully, but these errors were encountered: