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.

Sign up for GitHub

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

Jump to bottom

Google Kick Start 2020 Round F 题解 #21

Open

utterances-bot opened this issue Nov 14, 2020 · 1 comment

utterances-bot commented Nov 14, 2020

Google Kick Start 2020 Round F 题解 | CP Wiki

因为进行了排序，最终的时间复杂度为$O(N\log N)$。

https://cp-wiki.vercel.app/tutorial/kick-start/2020F/

upupming commented Nov 14, 2020

感觉 Round F 的 D 题有点看不太明白，请问作者是如何想到这个点子上的呢？怎么想到前缀和这个表示方法、以及为什么更新方法是这样一个公式呢？

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment