摘要:
浅谈莫队: "https://www.cnblogs.com/AKMer/p/10374756.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=3052" 把问题搬到欧拉序上来就是裸的带修改莫队了。 每次加减某种颜色直接加减个数系 阅读全文
posted @ 2019-02-15 10:19
AKMer
阅读(188)
评论(0)
推荐(0)
摘要:
浅谈莫队: "https://www.cnblogs.com/AKMer/p/10374756.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=2120" 分块做法: "https://www.cnblogs.com/AKMer/ 阅读全文
posted @ 2019-02-15 10:18
AKMer
阅读(139)
评论(0)
推荐(0)
摘要:
浅谈莫队: "https://www.cnblogs.com/AKMer/p/10374756.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=3809" 用树状数组维护区间内元素个数,直接在树状数组上统计即可。 然后就$TLE$ 阅读全文
posted @ 2019-02-15 10:07
AKMer
阅读(136)
评论(0)
推荐(0)
摘要:
浅谈莫队: "https://www.cnblogs.com/AKMer/p/10374756.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=3289" 用树状数组维护区间内元素的个数,动态删/加逆序对即可。 时间复杂度:$O( 阅读全文
posted @ 2019-02-15 10:03
AKMer
阅读(220)
评论(0)
推荐(0)
摘要:
浅谈莫队: "https://www.cnblogs.com/AKMer/p/10374756.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=2038" 首先答案肯定是$\frac{\sum cnt_i (cnt_i 1)}{r 阅读全文
posted @ 2019-02-15 09:56
AKMer
阅读(176)
评论(0)
推荐(0)