原题 翻译 先查询\([1,m]\)的位置,再查询\(m,2m,3m,...,\)的位置,然后再判断这些位置是否和之前\([1,m]\)中的数相等 操作次数为\(m + \frac{n}{m}\),取\(m = \sqrt n\)时最优本栏目推荐文章CF414B - Mashmokh and ACMCF-613-DCF1201C - Maximum MedianAtCoder Beginner Contest 335 G Discrete Logarithm ProblemsCF1876D LexichromatographyAT_abc243_g [ABC243G] Sqrt题解AT_abc243_g [ABC243G] Sqrt题解AT_cf17_final_j 题解CF1900E 题解CF1896E 题解1840G 1840 CF G11840g cf g1 题解1840c cf 1840g cf g2 1840f cf 1840d 1840e 1840 1840c 1840g solution festival wooden 1840d