随笔分类 -  数据结构 - 树状数组

【CF1553F】Pairwise Modulo - 树状数组
摘要：题目描述 You have an array \(a\) consisting of \(n\) distinct positive integers, numbered from \(1\) to \(n\) . Define \(p_k\) as \(p_k = \sum_{1 \le i, j 阅读全文
posted @ 2021-07-27 15:48 lrj124 阅读(116) 评论(0) 推荐(0)