﻿<?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++博客-希望的海洋-随笔分类-USACO</title><link>http://www.cppblog.com/snowshine09/category/17460.html</link><description>Ain't about how fast I get there,ain't about what's waiting on the other side</description><language>zh-cn</language><lastBuildDate>Sun, 18 Sep 2011 00:52:22 GMT</lastBuildDate><pubDate>Sun, 18 Sep 2011 00:52:22 GMT</pubDate><ttl>60</ttl><item><title>usaco_clocks dfs/bfs/位运算</title><link>http://www.cppblog.com/snowshine09/archive/2011/09/13/155641.html</link><dc:creator>拥梦的小鱼</dc:creator><author>拥梦的小鱼</author><pubDate>Tue, 13 Sep 2011 03:40:00 GMT</pubDate><guid>http://www.cppblog.com/snowshine09/archive/2011/09/13/155641.html</guid><wfw:comment>http://www.cppblog.com/snowshine09/comments/155641.html</wfw:comment><comments>http://www.cppblog.com/snowshine09/archive/2011/09/13/155641.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/snowshine09/comments/commentRss/155641.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/snowshine09/services/trackbacks/155641.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: The ClocksIOI'94 - Day 2Consider nine clocks arranged in a 3x3 array thusly: |-------| |-------| |-------| | | | | | | | |---O | |---O | | O | | | | | | | |-------| |-------| |-------| A B C |-------|...&nbsp;&nbsp;<a href='http://www.cppblog.com/snowshine09/archive/2011/09/13/155641.html'>阅读全文</a><img src ="http://www.cppblog.com/snowshine09/aggbug/155641.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/snowshine09/" target="_blank">拥梦的小鱼</a> 2011-09-13 11:40 <a href="http://www.cppblog.com/snowshine09/archive/2011/09/13/155641.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>usaco_packrec暴搜</title><link>http://www.cppblog.com/snowshine09/archive/2011/08/24/154232.html</link><dc:creator>拥梦的小鱼</dc:creator><author>拥梦的小鱼</author><pubDate>Wed, 24 Aug 2011 10:21:00 GMT</pubDate><guid>http://www.cppblog.com/snowshine09/archive/2011/08/24/154232.html</guid><wfw:comment>http://www.cppblog.com/snowshine09/comments/154232.html</wfw:comment><comments>http://www.cppblog.com/snowshine09/archive/2011/08/24/154232.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/snowshine09/comments/commentRss/154232.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/snowshine09/services/trackbacks/154232.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这道题给了6个图，实际只需考虑5种（后两个相同）。最后一个模型自己没有抽象出来。还是逻辑清晰，比较不容易出错。头开始设许多临时变量，总是不知道具体值是多少，结果一直debug，还一直bug。。&#8857;﹏&#8857;b汗。。用4个rec结构记录比较好。最后一个模型，是左边两个，右边两个，然后根据两边上面矩形的高度情况，讨论矩形整体的宽。注意，自己设的变量最好还是写出来吧。此题竖着的边|，分别...&nbsp;&nbsp;<a href='http://www.cppblog.com/snowshine09/archive/2011/08/24/154232.html'>阅读全文</a><img src ="http://www.cppblog.com/snowshine09/aggbug/154232.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/snowshine09/" target="_blank">拥梦的小鱼</a> 2011-08-24 18:21 <a href="http://www.cppblog.com/snowshine09/archive/2011/08/24/154232.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>usaco_calflac多行文件中找出最长回文串</title><link>http://www.cppblog.com/snowshine09/archive/2011/08/11/153038.html</link><dc:creator>拥梦的小鱼</dc:creator><author>拥梦的小鱼</author><pubDate>Thu, 11 Aug 2011 03:23:00 GMT</pubDate><guid>http://www.cppblog.com/snowshine09/archive/2011/08/11/153038.html</guid><wfw:comment>http://www.cppblog.com/snowshine09/comments/153038.html</wfw:comment><comments>http://www.cppblog.com/snowshine09/archive/2011/08/11/153038.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/snowshine09/comments/commentRss/153038.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/snowshine09/services/trackbacks/153038.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 回文串不考虑除字母以外的字符，并且不区分大小写。strupr()usaco不让用，可能toupper可以。strcat(s1,s2)中s1必须为数组才可以不报错。while(fgets(line,100,fin)!=NULL)读入的一行包括结尾的换行符。注意处理大小写情况。第一种方法在usaco的test8中超时了。第二种，网上查的DP方法，讨论奇偶性，高效简单快捷。（1）暴搜。每读入一行，从此行...&nbsp;&nbsp;<a href='http://www.cppblog.com/snowshine09/archive/2011/08/11/153038.html'>阅读全文</a><img src ="http://www.cppblog.com/snowshine09/aggbug/153038.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/snowshine09/" target="_blank">拥梦的小鱼</a> 2011-08-11 11:23 <a href="http://www.cppblog.com/snowshine09/archive/2011/08/11/153038.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>