<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Trie on 111qqz's blog</title><link>https://111qqz.com/en/tags/trie/</link><description>Recent content in Trie on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sat, 11 Nov 2017 18:04:34 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/trie/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 6059 | 2017 Multi-University Training Contest - Team 3 Kanade's trio (trie)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-6059/</link><pubDate>Sat, 11 Nov 2017 18:04:34 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-11-11-hdu-6059/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=6059" target="_blank" rel="noreferrer"&gt;http://acm.hdu.edu.cn/showproblem.php?pid=6059&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;含 N 个数字的 A 数组，求有多少个三元组 &lt;code&gt;(i,j,k)&lt;/code&gt; 满足 i&amp;lt;j&amp;lt;k 且a[i]^a[j] &amp;lt; a[j]^a[k]&lt;/p&gt;</description></item><item><title>poj 2001 Shortest Prefixes (trie树)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-poj-2001/</link><pubDate>Mon, 15 Aug 2016 19:22:36 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-poj-2001/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2001" target="_blank" rel="noreferrer"&gt;poj 2001 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个字符串的表，问每个字符串的简化表示。简化表示的要求是，以该字符串的最短的而且不能产生歧义的前缀来表示。&lt;/p&gt;</description></item><item><title>poj 3630 Phone List (带删除操作的静态trie树模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-poj-3630/</link><pubDate>Mon, 15 Aug 2016 18:52:16 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-poj-3630/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3630" target="_blank" rel="noreferrer"&gt;poj 3630 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个字符串，问是否满足所有的字符串都不以其他的字符串为前缀。&lt;/p&gt;</description></item><item><title>hdu 1247 Hat’s Words (trie树)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-hdu-1247/</link><pubDate>Mon, 15 Aug 2016 16:36:29 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-hdu-1247/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1247" target="_blank" rel="noreferrer"&gt;hdu 1247 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个字符串的单词表，输出所有的字符串a，满足字符串a是由n中另外两个字符串拼接成的。&lt;/p&gt;</description></item><item><title>hdu 5536 || 2015 长春区域赛 J Chip Factory (带删除操作的trie树)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-hdu-5536/</link><pubDate>Mon, 15 Aug 2016 15:54:40 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-hdu-5536/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=5536" target="_blank" rel="noreferrer"&gt;hdu 5536 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个数，然后问最大的(a[i]+a[j])^a[k]  (i,j,k互不相同)&lt;/p&gt;</description></item><item><title>hdu 4828 Xor Sum (trie 树模板题，经典应用)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-hdu-4828-xor-sum-trie-e6a091e6a8a1e69dbfe9a298efbc8ce7bb8fe585b8e5ba94e794a8/</link><pubDate>Mon, 15 Aug 2016 13:09:28 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-15-hdu-4828-xor-sum-trie-e6a091e6a8a1e69dbfe9a298efbc8ce7bb8fe585b8e5ba94e794a8/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=4825" target="_blank" rel="noreferrer"&gt;hdu 4825 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给定n个数，然后给出m个询问，每组询问一个数x，问n中的数y使得x和y的异或和最大。&lt;/p&gt;</description></item><item><title>hdu 1251 统计难题 (trie树模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-14-hdu-1251/</link><pubDate>Sun, 14 Aug 2016 16:06:02 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-14-hdu-1251/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1251" target="_blank" rel="noreferrer"&gt;hdu 1251 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：先给一个单词表，然后给出若干查询，每个查询一个单词，问单词表中以这个单词为前缀的单词的个数。&lt;/p&gt;</description></item></channel></rss>