The Editorial provides a Fast Fourier Transformation solution O(nlgn)... which is too maths for me. In the leaderboard, I found a not-that-fast O(n^2) solution, with a very smart observation. AI检测代码解析 #include <cstdio>#include<cstring>#include<iostream>#include<sstream>#include<set...