Monster_Qi

摘要： "传送门" 解题思路 莫队+树状数组。把求$[a,b]$搞成前缀和形式，剩下的比较裸吧，用$cnt$记一下数字出现次数。时间复杂度$O(msqrt(n)log(n)$，莫名其妙过了。 代码 cpp include include include include include using names 阅读全文