�??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>&#22269;&#20135;&#23567;&#35270;&#39057;&#22312;&#32447;&#25773;&#25918;&#44;&#20037;&#20037;&#31934;&#21697;&#22269;&#20135;&#20037;&#31934;&#22269;&#20135;&#29233;&#44;&#22269;&#20135;&#31934;&#21697;&#26085;&#38889;&#20037;&#20037;&#20037;</title><link>http://www.aygfsteel.com/Artvip/</link><description>public class code (string [art])</description><language>zh-cn</language><lastBuildDate>Sun, 18 May 2025 12:59:28 GMT</lastBuildDate><pubDate>Sun, 18 May 2025 12:59:28 GMT</pubDate><ttl>60</ttl><item><title>About Introduction to Algorithms </title><link>http://www.aygfsteel.com/Artvip/archive/2006/05/01/44304.html</link><dc:creator>Art</dc:creator><author>Art</author><pubDate>Mon, 01 May 2006 13:05:00 GMT</pubDate><guid>http://www.aygfsteel.com/Artvip/archive/2006/05/01/44304.html</guid><wfw:comment>http://www.aygfsteel.com/Artvip/comments/44304.html</wfw:comment><comments>http://www.aygfsteel.com/Artvip/archive/2006/05/01/44304.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.aygfsteel.com/Artvip/comments/commentRss/44304.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/Artvip/services/trackbacks/44304.html</trackback:ping><description><![CDATA[
		<span style="FONT-FAMILY: arial">Aho, Alfred V., John E. Hopcroft, �?Jeffrey D. Ullman. �?strong><em>计算机算法之设计与分析》（The Design and Analysis of Computer Algorithms�Q?Addison-Wesley</em></strong>�Q?1974. �l�典作品�Q�但是在�|�络���，�U�性规划和�q�代���法斚w��较缺����?Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms. <br /><br /><br />Aho�Q?Alfred V.�Q?John E. Hopcroft�Q?�?Jeffrey D. Ullman. �?strong><em>数据�l�构与算法》（Data Structures and Algorithms�Q?Addison-Wesley</em></strong>�Q?1983. 重新改版�q�后是以前作《计���机���法之设计与分析》（The Design and Analysis of Computer Algorithms �Q�前六章所改版的较基本版本�?br />Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms.<br /><br /><br /><br />Baase�Q?Sara. <strong><em>《计���机���法�Q�设计与分析��D���Q�第二版》（Computer Algorithms: Introduction to Design and Analysis. 2nd ed�Q?Addison-Wesley</em></strong>�Q?1988. 普通参考，���管它的说明有时是�R草扼要的�?br />Baase, Sara. Computer Algorithms: Introduction to Design and Analysis. 2nd ed. Addison-Wesley, 1988. General reference, although the exposition is sometimes terse or sketchy.<br /><br /><br /><br />Bentley�Q?Jon. <em><strong>《程序设计明珠》（Programming Pearls�Q?Addison-Wesley</strong></em>�Q?1986. ���法设计在��Y件工�E�中的实用。（Programming Pearls �J�体中文�? 译者：讔R���E�，出版商：基峰�Q�出版日期：2001-11-22�Q�ISBN�Q?575668804�Q?br />Bentley, Jon. Programming Pearls. Addison-Wesley, 1986. Applications of algorithm design techniques to software engineering.<br /><br /><br /><br />Bentley�Q?Jon. <strong><em>《更多的�E�序设计明珠》（More Programming Pearls�Q?Addison-Wesley</em></strong>�Q?1988. 更多���法设计在��Y件工�E�中的实用�?br />Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.<br /><br /><br /><br />Bentley�Q?Jon Louis. <em><strong>《编写有效率的程序》（Writing Efficient Programs�Q?Prentice-Hall</strong></em>�Q?1982. 非常杰出的效能精�q�调整�?br />Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.<br /><br /><br /><br />Brassard�Q?Gilles �?Paul Bratley. <strong><em>《算法：理论与实��c��，Prentice-Hall</em></strong>�Q?1988. 很好的范例及习题�Q�着重于�Ҏ��而不是个别的问题�?br />Brassard, Gilles and Paul Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988. Good examples and problems. Focus on methods rather than specific problems.<br /><br /><br /><br />Chung�Q?Kai Lai. <strong><em>《基���概率理论与随������E�》，Springer-Verlag</em></strong>�Q?1974. �Ҏ��率直觉性的演示课�?br />Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introduction to probability.<br /><br /><br /><br />Even�Q?Shimon. <strong><em>《图形算法》，Computer Science Press</em></strong>�Q?1979. 对图形算法有�q�泛的论�q�ͼ�包含了网�l�流及��^面性�?br />Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.<br /><br /><br /><br />Feller�Q?William. <strong><em>《概率理论导��Z��应用》，John Wiley &amp; Sons</em></strong>�Q?Vol 1. 1968�Q?Vol 2. 1971. �Ҏ��率很好的参考�?br />Feller, William. An Introduction to Probability Theory and Its Applications. John Wiley &amp; Sons, Vol 1. 1968, Vol 2. 1971. Excellent reference for probability theory.<br /><br /><br /><br />Garey�Q?Michael R. 与David S. Johnson. �?strong><em>计算��Z����N��驭性：对NP完整性理论的指南》，San Francisco: W. H. Freeman &amp; Co</em></strong>�Q?1979. 专注于NP完整性的参考书。在后半部含有一份NP完整问题集的列表及在书中出现�q�，针对多项式时间特别情�늚����法的参考�?br />Garey, Michael R. and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman &amp; Co., 1979. Reference book devoted to NP-completeness. The second half contains an extensive list of NP-complete problems and references to algorithms in the literature for polynomial-time special cases.<br /><br /><br /><br />Gonnet�Q?G. H. <em><strong>《算法与数据�l�构手册》，Addison-Wesley</strong></em>�Q?1984. Pascal �?C 码， 真正执行旉���的比较，和对研究报告中分析的指示�?br />Gonnet, G. H. Handbook of Algorithms and Data Structures. Addison-Wesley, 1984. Code in Pascal and C, comparisons of actual running times, and pointers to analysis in research papers.<br /><br /><br /><br />Gusfield�Q?Dan. <strong><em>《字�Ԍ��树，与序列的���法》， Cambridge University Press</em></strong>�Q?1997. 操作字符字串及序列的���法的大概论�q��?br />Gusfield, Dan. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997. General treatment of algorithms that operate on character strings and sequences.<br /><br /><br /><br />Horowitz�Q?Ellis 与Sartaj Sahni. �?em><strong>计算机算法基���》，Computer Science Press</strong></em>�Q?1978. 择重介绍了数据结构，动态编�E�，以及分支与界限法�?br />Horowitz, Ellis and Sartaj Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978. Good on data structures, dynamic programming, and branch-and-bound algorithms.<br /><br /><br /><br />Kingston�Q?Jeffrey H. <em><strong>《算法与数据�l�构�Q�设计，正确性，分析》，Addison-Wesley Publishing Co</strong></em>.�Q?1991. 一本优良的数据�l�构导入书，关于���法正确性有一���不错的章节�?br />Kingston, Jeffrey H. Algorithms and Data Structures: Design, Correctness, Analysis. Addison-Wesley Publishing Co., 1991. A nice introductory book on data structures, with a good chapter on algorithm correctness.<br /><br /><br /><br />Knuth�Q?Donald E. <strong><em><font color="#ff0000">《计���机�E�序设计艺术》，Addison-Wesley</font></em></strong>. 三卷如百�U�全书般的作品：(1) 基础���法�Q?(2) 半数值算法， �?(3) 排序与搜寅R�?br />Knuth, Donald E. The Art of Computer Programming. Addison-Wesley. Encyclopedic work in three volumes: (1) Fundamental Algorithms, (2) Seminumerical Algorithms, and (3) Sorting and Searching.<br /><br /><br /><br />Lawler�Q?Eugene L. <em><strong>《组合式优选》，Holt�Q?Rinehart�Q?and Winston</strong></em>�Q?1976. 囄���法（密集�?�Q�网�l�流�Q�与�U�型规划。开始几章是很优�U�的�?br />Lawler, Eugene L. Combinatorial Optimization. Holt, Rinehart, and Winston, 1976. Graph algorithms (dense graphs), network flows, and linear programming. First few chapters are excellent.<br /><br /><br /><br />Liu�Q?C. L. <em><strong>《组合数学导论》，McGraw-Hill</strong></em>�Q?1968. 与计���机�U�学有关的组合数学。有优秀的习�?<br />Liu, C. L. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.<br /><br /><br /><br />Manber�Q?Udi. <em><strong><font color="#ff0000">《算法导论》，Addison-Wesley</font></strong></em>�Q?1989. 着重于创造力的初�U�文章�?br />Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.<br /><br /><br /><br />Mehlhorn�Q?Kurt. <em><strong>《数据结构与���法》，Springer-Verlag</strong></em>�Q?1984. 三卷�Q?(1) 排序与搜寻， (2) 囄���法和NP�Q�完整性， �?(3) 多维度查询与计算几何。基本及高阶论题的讲义�?br />Mehlhorn, Kurt. Data Structures and Algorithms. Springer-Verlag, 1984. Three volumes: (1) Sorting and Searching, (2) Graph Algorithms and NP-Completeness, and (3) Multidimensional Searching and Computational Geometry. Lecture notes on basic and advanced topics.<br /><br /><br /><br />Niven�Q?Ivan 与Herbert S. Zuckerman. �?em><strong>数论��D��》，John Wiley &amp; Sons</strong></em>�Q?1980. 有阅��M�h值的的数论入门介�l��?br />Niven, Ivan and Herbert S. Zuckerman. An Introduction to the Theory of Numbers. John Wiley &amp; Sons, 1980. Readable introduction to number theory.<br /><br /><br /><br />Papadimitriou�Q?Christos H. 与Kenneth Steiglitz. <em><strong>《组合式优选：���法与复杂性》，Prentice-Hall</strong></em>�Q?1982. �U�性规划和它的变体�?br />Papadimitriou, Christos H. and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982. Linear programming and its variants.<br /><br /><br /><br />Press�Q?William P.�Q?Brian P. Flannery�Q?Saul A. Teukolsky�Q?�?William T. Vetterling. <em><strong>《C的数值处方：�U�学计算的艺术》，Cambridge: Cambridge University Press</strong></em>�Q?1988. 数值算法的�E�序�?<br />Press, William P., Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. Numerical Recipies in C: The Art of Scientific Computing. Cambridge: Cambridge University Press, 1988. Code for numerical algorithms.<br /><br /><br /><br />Reingold�Q?E. M.�Q?J. Nievergelt�Q?与N. Deo. �?em><strong>�l�合���法�Q�理��Z��应用》，Prentice-Hall</strong></em>�Q?1977. 在递归关系和二元树斚w��的内容不错�?br />Reingold, E. M., J. Nievergelt, and N. Deo. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, 1977. Good on recurrence relations and binary search trees.<br /><br /><br /><br />Sedgewick�Q?Robert . <em><strong>《算法，�W�二版》，Addison-Wesley</strong></em>�Q?1988. 有着优秀论题�q�度的初阶文章。不重于分析�Q�但是有很多图�?br />Sedgewick, Robert . Algorithms. 2nd ed. Addison-Wesley, 1988. Elementary text with an excellent breadth of topics. Light on analysis, but lots of figures.<br /><br /><br /><br />Sipser�Q?Michael. <em><strong>《运���理论导论》，PWS Publishing Co</strong></em>.�Q?1997. 对可计算性及复杂性理论很好的文章�?br />Sipser, Michael. Introduction to the Theory of Computation. PWS Publishing Co., 1997. A good text on computability and complexity theory.<br /><br /><br /><br />Tarjan�Q?Robert Endre. <em><strong>《数据结构与�|�络���法》，Society for Industrial and Applied Mathematics</strong></em>�Q?1983. 有一堆好东西的高阶书�?br />Tarjan, Robert Endre. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. Advanced book with tons of good stuff.</span>
		<br />
<img src ="http://www.aygfsteel.com/Artvip/aggbug/44304.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/Artvip/" target="_blank">Art</a> 2006-05-01 21:05 <a href="http://www.aygfsteel.com/Artvip/archive/2006/05/01/44304.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>�E�序员未�?</title><link>http://www.aygfsteel.com/Artvip/archive/2006/04/30/44142.html</link><dc:creator>Art</dc:creator><author>Art</author><pubDate>Sun, 30 Apr 2006 02:27:00 GMT</pubDate><guid>http://www.aygfsteel.com/Artvip/archive/2006/04/30/44142.html</guid><wfw:comment>http://www.aygfsteel.com/Artvip/comments/44142.html</wfw:comment><comments>http://www.aygfsteel.com/Artvip/archive/2006/04/30/44142.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.aygfsteel.com/Artvip/comments/commentRss/44142.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/Artvip/services/trackbacks/44142.html</trackback:ping><description><![CDATA[一个程序员对自��q��未来很迷茫，于是去问上帝�?<br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?br />上帝说“我的孩子，你去问Lippman�Q�他现在领导的程序员的队伍可能是地球上最大的�?<br /><br />于是他去�?a target="_blank" >Lippman</a>�?br /><a target="_blank" >Lippman</a>说“程序员的未来就是驾驭程序员�?<br />�q�个�E�序员对�q�个未来不满意，于是他又去问上帝�?br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?br />上帝说“我的孩子，你去问Gates�Q�他现在所拥有的胦产可能是地球上最多的�?<br />于是他去�?a target="_blank" >Gates</a>�?<br />Gates说“程序员的未来就是榨取程序员�?<br />�q�个�E�序员对�q�个未来不满意，于是他又去问上帝�?<br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?br />上帝说“我的孩子，你去问侯��P��他写的计���机书的读者可能是地球上最多的�?<br />于是他去问侯捗��?<br />侯捷说“程序员的未来就是诱惑程序员�?<br />�q�个�E�序员对�q�个未来不满意，于是他又去问上帝�?<br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?<br />上帝摇摇头“唉�Q�我的孩子，你还是别当程序员了”）<br />一个程序员对自��q��未来很迷茫，于是去问上帝�?<br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?br />上帝说“我的孩子，你去问Lippman�Q�他现在领导的程序员的队伍可能是地球上最大的�?<br /><br />于是他去�?a target="_blank" >Lippman</a>�?br /><a target="_blank" >Lippman</a>说“程序员的未来就是驾驭程序员�?<br />�q�个�E�序员对�q�个未来不满意，于是他又去问上帝�?br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?br />上帝说“我的孩子，你去问Gates�Q�他现在所拥有的胦产可能是地球上最多的�?<br />于是他去�?a target="_blank" >Gates</a>�?<br />Gates说“程序员的未来就是榨取程序员�?<br />�q�个�E�序员对�q�个未来不满意，于是他又去问上帝�?<br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?br />上帝说“我的孩子，你去问侯��P��他写的计���机书的读者可能是地球上最多的�?<br />于是他去问侯捗��?<br />侯捷说“程序员的未来就是诱惑程序员�?<br />�q�个�E�序员对�q�个未来不满意，于是他又去问上帝�?<br />“万能的上帝呀�Q�请你告诉我�Q�我的未来会怎样�Q��?<br />上帝摇摇头“唉�Q�我的孩子，你还是别当程序员了”）<br /><img src ="http://www.aygfsteel.com/Artvip/aggbug/44142.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/Artvip/" target="_blank">Art</a> 2006-04-30 10:27 <a href="http://www.aygfsteel.com/Artvip/archive/2006/04/30/44142.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>.net开发趣题两�?联想优秀�E�序员与专业�E�序�?</title><link>http://www.aygfsteel.com/Artvip/archive/2006/04/30/44140.html</link><dc:creator>Art</dc:creator><author>Art</author><pubDate>Sun, 30 Apr 2006 02:26:00 GMT</pubDate><guid>http://www.aygfsteel.com/Artvip/archive/2006/04/30/44140.html</guid><wfw:comment>http://www.aygfsteel.com/Artvip/comments/44140.html</wfw:comment><comments>http://www.aygfsteel.com/Artvip/archive/2006/04/30/44140.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.aygfsteel.com/Artvip/comments/commentRss/44140.html</wfw:commentRss><trackback:ping>http://www.aygfsteel.com/Artvip/services/trackbacks/44140.html</trackback:ping><description><![CDATA[
		<font face="Arial">一、月薪上万的net开发�h员问题：<br />有一队伍长１�Q�０�c�I��匀速前�q�，传��o兵以匀速从队首�q�动到队������后返回队首，光���队伍前进了１�Q�０�c�I��问传令兵�q�动的距���R�?br />假设��d���׃��100�U? 队伍的速度则�ؓ1; V��Z��令兵速度, 传��o兵到队尾的距���MؓS�?br />则��d���?100 M + 2 * S�?br />---------------------------<br />传��o兵走S�Q�则此时部队�?00-S�Q�传令兵到尾部�?br />往前走�Q��\�E��ؓ100+S�Q�而部队刚才走�?00-S�Q�则此时当走100-�Q?00-S�Q?= S<br />旉���相同�?br />则有<br />S / �Q?00+S �Q? �Q?00-S�Q?/S<br />=&gt; S^2 = 10000 -S^2<br />=&gt; S^2 = 5000;<br />=&gt; S = 70.71067811865475244008443621049 <br />=&gt;CLOSE<br />开方函数在Math命名�I�间里有�?br />也可自己�q�代出来�?br />二、月�?万，微��Y中国研究院最新面试题�Q?br />���明和小强都是张老师的学生，张老师的生日是M月N日，<br />2人都知道张老师的生日是下列10�l�中的一天，<br />张老师把M值告诉了���明�Q�把N值告诉了���强�Q?br />张老师问他们知道他的生日是那一天吗�Q?br />3�?�?3�?�?3�?�?br />6�?�?6�?�?br />9�?�?9�?�?br />12�?�?12�?�?12�?�?br />���明��_��如果我不知道的话�Q�小�����定也不知�?br />���强��_��本来我也不知道，但是现在我知道了<br />���明��_��哦，那我也知道了<br />��h��据以上对话推断出张老师的生日是哪一�?br /><br />理由�Q?br />1. ���明��_��如果我不知道的话�Q�小�����定也不知道，  那么�Q?�?日和 12�?�?���p��剔除<br />2. ���明��_��如果我不知道的话�Q�小�����定也不知道＋���强��_��本来我也不知道，但是现在我知道了<br />那么�Q�只�?�?日是唯一���定�?br /></font>
<img src ="http://www.aygfsteel.com/Artvip/aggbug/44140.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.aygfsteel.com/Artvip/" target="_blank">Art</a> 2006-04-30 10:26 <a href="http://www.aygfsteel.com/Artvip/archive/2006/04/30/44140.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>                                                                                                                                                                                                              <footer>
<div class="friendship-link">
<a href="http://www.aygfsteel.com/" title="&#29408;&#29408;&#20037;&#20037;&#20122;&#27954;&#27431;&#32654;&#19987;&#21306;&#95;&#20013;&#25991;&#23383;&#24149;&#20122;&#27954;&#32508;&#21512;&#20037;&#20037;&#50;&#48;&#50;&#95;&#22269;&#20135;&#31934;&#21697;&#20122;&#27954;&#31532;&#20116;&#21306;&#22312;&#32447;&#95;&#26085;&#26412;&#20813;&#36153;&#32593;&#31449;&#35270;&#39057;">&#29408;&#29408;&#20037;&#20037;&#20122;&#27954;&#27431;&#32654;&#19987;&#21306;&#95;&#20013;&#25991;&#23383;&#24149;&#20122;&#27954;&#32508;&#21512;&#20037;&#20037;&#50;&#48;&#50;&#95;&#22269;&#20135;&#31934;&#21697;&#20122;&#27954;&#31532;&#20116;&#21306;&#22312;&#32447;&#95;&#26085;&#26412;&#20813;&#36153;&#32593;&#31449;&#35270;&#39057;</a>

</div>

</footer>


��վ֩���ģ�壺
<a href="http://" target="_blank">��ɽ��</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">᯹���</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">�����</a>|
<a href="http://" target="_blank">�dz���</a>|
<a href="http://" target="_blank">��Զ��</a>|
<a href="http://" target="_blank">���������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">��̨��</a>|
<a href="http://" target="_blank">��ƽ��</a>|
<a href="http://" target="_blank">��Ӻ��</a>|
<a href="http://" target="_blank">̨����</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">ƽ����</a>|
<a href="http://" target="_blank">�����</a>|
<a href="http://" target="_blank">�����</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">��������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">�ʹ���</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">����ɽ��</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">ľ��</a>|
<a href="http://" target="_blank">���ء�</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">�Ͻ�</a>|
<a href="http://" target="_blank">��³����</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">��ʯ��</a>|
<a href="http://" target="_blank">����</a>|
<a href="http://" target="_blank">������</a>|
<a href="http://" target="_blank">��Ȫ��</a>|
<script>
(function(){
    var bp = document.createElement('script');
    var curProtocol = window.location.protocol.split(':')[0];
    if (curProtocol === 'https') {
        bp.src = 'https://zz.bdstatic.com/linksubmit/push.js';
    }
    else {
        bp.src = 'http://push.zhanzhang.baidu.com/push.js';
    }
    var s = document.getElementsByTagName("script")[0];
    s.parentNode.insertBefore(bp, s);
})();
</script>
</body>