kZjPBD.jpg
2019年8月13日
【HDU2019多校】 K-th Closest Distance （主席树+二分)
摘要： You have an array: a1, a2, , an and you must answer for some queries. For each query, you are given an interval [L, R] and two numbers p and K. Your 阅读全文
posted @ 2019-08-13 20:27 Through_The_Night 阅读(184) 评论(0) 推荐(0)
【HDU2019多校】Easy Math Problem (插值+Min25+杜教筛）
摘要： Problem Description One day, Touma Kazusa encountered a easy math problem. Given n and k, she need to calculate the following sum modulo 1e9+7.∑ni=1∑n 阅读全文
posted @ 2019-08-13 10:51 Through_The_Night 阅读(439) 评论(0) 推荐(0)