https://111qqz.com/en/tags/%E5%8C%BA%E9%97%B4%E7%AC%ACk%E5%A4%A7/Recent content in 区间第k大 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 18 Oct 2017 04:52:00 +0000https://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>