https://111qqz.com/en/tags/%E7%A6%BB%E6%95%A3%E5%8C%96/Recent content in 离散化 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 27 Sep 2017 10:59:46 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-27-hdu-1542/Wed, 27 Sep 2017 10:59:46 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-27-hdu-1542/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=1542" target="_blank" rel="noreferrer">hdu1542题目链接</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(100)个矩形的面积并。</p>https://111qqz.com/en/post/acm-icpc/2017/2017-09-26-hdu-4288/Tue, 26 Sep 2017 06:56:57 +0000https://111qqz.com/en/post/acm-icpc/2017/2017-09-26-hdu-4288/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=4288" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：n（1E5）个操作，分为三种，add x表示将x加到集合中（保证集合中之前没有x)，del x表示从集合中删掉x(保证集合中一定右x),sum表示求集合中所有元素按从小到大排列后，所有的下标中满足i%5=3的a[i]的和。1=&lt;x&lt;=1E9</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-05-cf61e/Mon, 05 Sep 2016 08:35:49 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-05-cf61e/<p><a href="http://codeforces.com/problemset/problem/61/E" target="_blank" rel="noreferrer">题目链接</a> 题意：给出n个数，求满足 i&lt;j&lt;k且a[i]&gt;a[j]&gt;a[k]的三元组有多少个。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-09-04-cf19d/Sun, 04 Sep 2016 13:47:07 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-09-04-cf19d/<p><a href="http://codeforces.com/problemset/problem/19/D" target="_blank" rel="noreferrer">题目链接</a></p> <p>题意：</p> <blockquote><p>在二维坐标平面内进行_n_ (1 ≤ <em>n</em> ≤ 2·105) 次操作。一共有三种类型操作。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-18-cf682b/Mon, 18 Jul 2016 11:56:35 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-18-cf682b/<p><a href="http://codeforces.com/problemset/problem/682/B" target="_blank" rel="noreferrer">cf682B题目链接</a></p> <p>题意：给出n个数。。每个数可以任意减小到一个正整数。。。问进行恰当的操作后。。。最小的没有出现的正整数的最大可能取值。。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-01-25-uva120/Mon, 25 Jan 2016 06:09:57 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-01-25-uva120/<p><a href="https://uva.onlinejudge.org/index.php?option=com_onlinejudge&amp;Itemid;=8&amp;page;=show_problem&amp;problem;=56" target="_blank" rel="noreferrer">https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid;=8&page;=show_problem&problem;=56</a></p> <p>题意：给出一个长度为n的序列（无重复元素），询问经过多少次flip(i)操作，使得序列升序排列。定义flip(i)为将1到n-i+1的元素反转&hellip; 思路：先离散化，然后注意读入&hellip;.</p>https://111qqz.com/en/post/acm-icpc/2015/2015-12-30-cf29c/Wed, 30 Dec 2015 12:27:15 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-12-30-cf29c/<p><a href="http://codeforces.com/contest/29/problem/C" target="_blank" rel="noreferrer">http://codeforces.com/contest/29/problem/C</a> 题意：给出n个边的关系，保证可以构成一条链。正向或者反向输出这个链。 思路：由于下标很大(1E9)，而关系个数只有1E5..需要离散化。。而且离散化的同时不能丢失边的关系。。。实际上。。直接用vector+map就好了。。。 map &gt;e;即可。然后找到一个度为1的点。。做个dfs&hellip;</p>https://111qqz.com/en/post/acm-icpc/2015/2015-08-06-sgu180/Thu, 06 Aug 2015 09:09:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-06-sgu180/<ul> <li>Inversions</li> </ul> <p>**Time Limit:**250MS **Memory Limit:**4096KB <strong>64bit IO Format:</strong>%I64d &amp; %I64u</p> <p>Submit <a href="http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86460#status//B/0" target="_blank" rel="noreferrer">Status</a></p> <p>Description</p> <h4 class="relative group">180. Inversions <div id="180-inversions" 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="#180-inversions" aria-label="Anchor">#</a> </span> </h4> <p>time limit per test: 0.25 sec. memory limit per test: 4096 KB</p>https://111qqz.com/en/post/acm-icpc/2015/2015-08-04-poj2299/Tue, 04 Aug 2015 13:13:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-04-poj2299/<p><strong>这道题可以总结的地方不少。</strong></p> <p><strong>１：对于一组乱序数列，每次只能交换相邻元素，达到有序交换的次数就是原数列中你逆序对的个数。</strong></p>https://111qqz.com/en/post/acm-icpc/2015/2015-08-01-hdu4022/Sat, 01 Aug 2015 02:12:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-08-01-hdu4022/<p>wa了两次，原因是在同一个点可能有多个基地。。。</p> <p>所以用set 是错误的，应该用multiset</p>https://111qqz.com/en/post/acm-icpc/2015/2015-07-31-hdu5233/Fri, 31 Jul 2015 19:04:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-07-31-hdu5233/<h1 class="relative group">Gunner II <div id="gunner-ii" 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="#gunner-ii" aria-label="Anchor">#</a> </span> </h1> <p>**Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1433    Accepted Submission(s): 540 **</p>