Live2d Test Env

随笔分类 -  离线乱搞---归并树

SPOJ：K-Query Online（归并树）
摘要：Given a sequence of n numbers a1, a2, ..., an and a number of k-queries. A k-query is a triple (i, j, k) (1 ≤ i ≤ j ≤ n). For each k-query (i, j, k), 阅读全文
posted @ 2018-05-17 22:55 nimphy 阅读(386) 评论(2) 推荐(0)