https://www.luogu.com.cn/article/bxloh3su
带平衡树的Garsia-Wachs(加西亚-瓦克斯)算法可以做到$O(n \log n)$

回复 @2_16鸡扒拌面 :

题目背景（在洛谷，需要联网

其实是向下取整

769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997

2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,

https://www.luogu.com.cn/article/w8rszr7f

好题！

$-1$

把endl改成'/n'就过了...

QOJ7258

为什么0提交

震撼美味（指我的15s代码

区间覆盖0或1时，一定要记住左边边界是L到（1/0出现的次数-1+L）！！！ 右边边界是（1/0出现的次数+L）到R！！！

$cand = p[bl+1][br-1]$

实现细节比较多，放一份代码，大家可以看。

莫队算法为什么是神？在谈论这个问题之前，我想先说说其他数据结构算法相较于莫队究竟差在了哪里。（后文见代码注释

https://www.luogu.com.cn/problem/AT_dp_t

如果你20分，那我告诉你要开longlong以防你重复播放战败cg。

太炫酷了