莫队算法(离线查询)SP3267 DQUERY - D-query题意有 n个数 m次查询 每次查询给出 范围 l 和 r 求 l ~r之间有多少不同的数 思路(其实线段树,树状数组都可以)莫队算法 AC代码123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub. Quick