Codewars. Naive subarray(分块 哈希)
给定长为$n$的序列$A_i$，求有多少个区间，满足区间中所有数的出现次数为奇数。
$n\leq 2\times10^5,\ A_i\leq 10^5$。
------------------------------------------------------------------------------------------------------------------------
很久以前的奇怪但现在依旧成立的签名
attack is our red sun $$\color{red}{\boxed{\color{red}{attack\ is\ our\ red\ sun}}}$$ ------------------------------------------------------------------------------------------------------------------------
很久以前的奇怪但现在依旧成立的签名
attack is our red sun $$\color{red}{\boxed{\color{red}{attack\ is\ our\ red\ sun}}}$$ ------------------------------------------------------------------------------------------------------------------------
