﻿<?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++博客-我是菜鸟我怕谁</title><link>http://www.cppblog.com/fmlwlh/</link><description>欢迎光临满风之楼</description><language>zh-cn</language><lastBuildDate>Tue, 14 Apr 2026 23:07:13 GMT</lastBuildDate><pubDate>Tue, 14 Apr 2026 23:07:13 GMT</pubDate><ttl>60</ttl><item><title>说说长春赛区的网赛</title><link>http://www.cppblog.com/fmlwlh/archive/2007/10/08/33747.html</link><dc:creator>fmlwlh</dc:creator><author>fmlwlh</author><pubDate>Mon, 08 Oct 2007 03:13:00 GMT</pubDate><guid>http://www.cppblog.com/fmlwlh/archive/2007/10/08/33747.html</guid><wfw:comment>http://www.cppblog.com/fmlwlh/comments/33747.html</wfw:comment><comments>http://www.cppblog.com/fmlwlh/archive/2007/10/08/33747.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/fmlwlh/comments/commentRss/33747.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/fmlwlh/services/trackbacks/33747.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 我们队过了三个题.通过率最高的三个.首先是H.LX写的,PE了一次.我看A,看完没有思路.接着看E,高精度的表达式求值.马上开始敲代码.可写了一会,发现没法处理阶乘的情况.只好放弃了.浪费了好多时间.这时SY看完了G题.跟我说了题目的意思.我觉得是DP,马上敲代码.写完了还担心int够不够.但一交,AC.一炮而过.这时,时间已经过了一半了.SY跟我说了B题的意思.一开始没思路.后来想到其实就是dijkstra,比一般的麻烦点.又开始敲代码.敲完了,可是连sample都没过.调试了一会才发现是题目理解错了,改过来,一交,AC.这时,还有半个小时.LX做A交了很多次都没过.一直到比赛完都没能把A题拿下.我们队的成绩也就定格在三个题.没做出四个题比较遗憾,但还好,比南航赛区的排名高了点.有进步就好. 
<img src ="http://www.cppblog.com/fmlwlh/aggbug/33747.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fmlwlh/" target="_blank">fmlwlh</a> 2007-10-08 11:13 <a href="http://www.cppblog.com/fmlwlh/archive/2007/10/08/33747.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>今天碰到了一个奇怪的问题</title><link>http://www.cppblog.com/fmlwlh/archive/2007/09/15/32243.html</link><dc:creator>fmlwlh</dc:creator><author>fmlwlh</author><pubDate>Fri, 14 Sep 2007 16:59:00 GMT</pubDate><guid>http://www.cppblog.com/fmlwlh/archive/2007/09/15/32243.html</guid><wfw:comment>http://www.cppblog.com/fmlwlh/comments/32243.html</wfw:comment><comments>http://www.cppblog.com/fmlwlh/archive/2007/09/15/32243.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/fmlwlh/comments/commentRss/32243.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/fmlwlh/services/trackbacks/32243.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;今天做PKU 1204,写完了,运行的时候老是报错,弄得我差点崩溃了,最后把p-&gt;next[id]=new (trieNode);改成<br>p-&gt;next[id]=new trieNode();后,马上就过了.new (trieNode);和new trieNode();到底有什么区别呢,现在还是不明白.
<img src ="http://www.cppblog.com/fmlwlh/aggbug/32243.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fmlwlh/" target="_blank">fmlwlh</a> 2007-09-15 00:59 <a href="http://www.cppblog.com/fmlwlh/archive/2007/09/15/32243.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>今天过了PKU 2337</title><link>http://www.cppblog.com/fmlwlh/archive/2007/09/13/32126.html</link><dc:creator>fmlwlh</dc:creator><author>fmlwlh</author><pubDate>Thu, 13 Sep 2007 06:17:00 GMT</pubDate><guid>http://www.cppblog.com/fmlwlh/archive/2007/09/13/32126.html</guid><wfw:comment>http://www.cppblog.com/fmlwlh/comments/32126.html</wfw:comment><comments>http://www.cppblog.com/fmlwlh/archive/2007/09/13/32126.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/fmlwlh/comments/commentRss/32126.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/fmlwlh/services/trackbacks/32126.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 欧拉回路的问题,麻烦的一点的是要把路径输出来,而且是按字典排序最小的,一开始我以为是比较整个字符串,原来是一个个单词比较的,深搜一下就过了.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 我的思路:<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;构图: 把每个单词当作一条边,始点为首字符,终点为尾字符.(最多有26个顶点)然后根据欧拉回路的性质就可以判断有没有回路.如果有回路的话,把每个顶点连出去的边按权值(字符串大小)排序.然后深搜输出字典序最小的即可.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 
<img src ="http://www.cppblog.com/fmlwlh/aggbug/32126.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fmlwlh/" target="_blank">fmlwlh</a> 2007-09-13 14:17 <a href="http://www.cppblog.com/fmlwlh/archive/2007/09/13/32126.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>终于过了pku 3378</title><link>http://www.cppblog.com/fmlwlh/archive/2007/09/12/fmlwlh.html</link><dc:creator>fmlwlh</dc:creator><author>fmlwlh</author><pubDate>Wed, 12 Sep 2007 03:23:00 GMT</pubDate><guid>http://www.cppblog.com/fmlwlh/archive/2007/09/12/fmlwlh.html</guid><wfw:comment>http://www.cppblog.com/fmlwlh/comments/32040.html</wfw:comment><comments>http://www.cppblog.com/fmlwlh/archive/2007/09/12/fmlwlh.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/fmlwlh/comments/commentRss/32040.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/fmlwlh/services/trackbacks/32040.html</trackback:ping><description><![CDATA[<p>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 前两天做这道题,先是wa,后来用自己写的高精度,由于效率太低,tle了,最后想了想,前面三遍归并的时候根本用不上高精度,改过来后2874ms险过,太开心了.</p>
<img src ="http://www.cppblog.com/fmlwlh/aggbug/32040.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fmlwlh/" target="_blank">fmlwlh</a> 2007-09-12 11:23 <a href="http://www.cppblog.com/fmlwlh/archive/2007/09/12/fmlwlh.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>