https://111qqz.com/en/tags/hust/Recent content in HUST on 111qqz's blogHugo -- gohugo.ioenhust.111qqz@gmail.com (111qqz)hust.111qqz@gmail.com (111qqz)© 2011-2026 111qqzMon, 13 Jul 2015 09:36:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-07-13-hust20150713/Mon, 13 Jul 2015 09:36:00 +0000hust.111qqz@gmail.com (111qqz)https://111qqz.com/en/post/acm-icpc/2015/2015-07-13-hust20150713/<p><a href="http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82557#problem/A" target="_blank" rel="noreferrer">http://acm.hust.edu.cn/vjudge/contest/view.action?cid=82557#problem/A</a></p> <p>Zk的解法：拆点，把每一个点存成两份，r[i]和r[n+i]</p>