03 2018 档案

树链剖分
摘要：树链剖分 problem bzoj1036 一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作： I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值 I II. QSU 阅读全文
posted @ 2018-03-16 09:14 foreignbill 阅读(106) 评论(0) 推荐(0)
杜教筛
摘要：BZOJ 3944 题目大意： 求$\sum_{i=1}^{n}\phi(i)$和$\sum_{i=1}^{n}\mu(i)$ n<2^31 令$F(n)$为$f(n)$前缀和，$G(n)$为$g(n)$前缀和，并且有$g(n)=\sum _{i|n}f(i)$，那么有 则 $F(n)=G(n 阅读全文
posted @ 2018-03-16 09:09 foreignbill 阅读(104) 评论(0) 推荐(0)
Codeforces Round #422 (Div. 2)
摘要：A I’m bored with life 题目要求 求两个数阶乘的gcd include define maxn 100000 define inf 0x3f3f3f3f define LL long long define pb push_back define pii pair define 阅读全文
posted @ 2018-03-16 09:07 foreignbill 阅读(99) 评论(0) 推荐(0)
Codeforces Round #421 (Div. 2)
摘要：A. Mister B and Book Reading Mister B once received a gift: it was a book about aliens, which he started read immediately. This book had c pages. At f 阅读全文
posted @ 2018-03-16 09:02 foreignbill 阅读(107) 评论(0) 推荐(0)
Codeforces Round #420 (Div. 2)
摘要：A Okabe and Future Gadget Laboratory Okabe needs to renovate the Future Gadget Laboratory after he tried doing some crazy experiments! The lab is repr 阅读全文
posted @ 2018-03-16 08:59 foreignbill 阅读(201) 评论(0) 推荐(0)
AtCoder Regular Contest 076
摘要：C – Reconciled? Snuke has N dogs and M monkeys. He wants them to line up in a row. As a Japanese saying goes, these dogs and monkeys are on bad terms. 阅读全文
posted @ 2018-03-16 08:56 foreignbill 阅读(254) 评论(0) 推荐(0)
Codeforces Round #419 (Div. 2)
摘要：题目链接:http://codeforces.com/contest/816 A Karen and Morning It is currently hh:mm, given in a 24 hour format. As you know, Karen loves palindromes, and 阅读全文
posted @ 2018-03-16 08:51 foreignbill 阅读(108) 评论(0) 推荐(0)