https://111qqz.com/en/tags/%E4%B8%BB%E5%B8%AD%E6%A0%91/Recent content in 主席树 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 18 Oct 2017 05:12:08 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-persistent-segment-tree-notes/Wed, 18 Oct 2017 05:12:08 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-persistent-segment-tree-notes/<p>起因是16长春CCPC遇到了一个全场万人过的主席树题目，然而我不会orz，哭哭</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-hdu-5919/Wed, 18 Oct 2017 04:52:00 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-18-hdu-5919/<p><a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5919" target="_blank" rel="noreferrer">题目链接</a></p> <h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>给定一个序列 n，有 m次查询，每次查询一个区间[l,r]，求区间中每一种数在区间中第一次出现的位置的中位数，强制在线。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-16-bzoj-1901/Mon, 16 Oct 2017 18:38:53 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-16-bzoj-1901/<h2 class="relative group">Description <div id="description" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#description" aria-label="Anchor">#</a> </span> </h2> <p>给定一个含有n个数的序列a[1],a[2],a[3]……a[n]，程序必须回答这样的询问：对于给定的i,j,k，在a[i],a[i+1</p>https://111qqz.com/en/post/acm-icpc/2017/2017-10-16-hdu-2665/Mon, 16 Oct 2017 14:39:39 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-10-16-hdu-2665/<h1 class="relative group">题意： <div id="题意" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor">#</a> </span> </h1> <p>求区间第k大数</p> <h1 class="relative group">思路： <div id="思路" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e6%80%9d%e8%b7%af" aria-label="Anchor">#</a> </span> </h1> <p>可持久化线段树。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-17-spoj-dquery/Sat, 17 Sep 2016 12:01:43 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-17-spoj-dquery/<p><a href="http://www.spoj.com/problems/DQUERY/" target="_blank" rel="noreferrer">题目链接</a> 题意：给出n个数，然后m个询问，每个询问一个区间[l,r],问该区间中不同的数有多少个。</p>