﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-acmercyj-文章分类-字典树</title><link>http://www.cppblog.com/acmercyj/category/16888.html</link><description /><language>zh-cn</language><lastBuildDate>Wed, 18 May 2011 13:15:00 GMT</lastBuildDate><pubDate>Wed, 18 May 2011 13:15:00 GMT</pubDate><ttl>60</ttl><item><title>HDU1251  trie树</title><link>http://www.cppblog.com/acmercyj/articles/146413.html</link><dc:creator>mr_chen</dc:creator><author>mr_chen</author><pubDate>Sun, 15 May 2011 06:16:00 GMT</pubDate><guid>http://www.cppblog.com/acmercyj/articles/146413.html</guid><wfw:comment>http://www.cppblog.com/acmercyj/comments/146413.html</wfw:comment><comments>http://www.cppblog.com/acmercyj/articles/146413.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/acmercyj/comments/commentRss/146413.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/acmercyj/services/trackbacks/146413.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 记得一年前 跑去CSDN问HDU1251（http://acm.hdu.edu.cn/showproblem.php?pid=1251）的写法，飞雪写了个很精简的代码，数组模拟字典树。问题是那个代码只适用于那道题目。后来有道开了一次网络邀请赛，当时就有那么一道字典树的题，我对着它无解。。今天，我去看了一下字典树，仅仅是靠自己理解了一下字典树的图。图片地址：http://baike.baidu.co...&nbsp;&nbsp;<a href='http://www.cppblog.com/acmercyj/articles/146413.html'>阅读全文</a><img src ="http://www.cppblog.com/acmercyj/aggbug/146413.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/acmercyj/" target="_blank">mr_chen</a> 2011-05-15 14:16 <a href="http://www.cppblog.com/acmercyj/articles/146413.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>