﻿<?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++博客-Dream! But what's my dream?</title><link>http://www.cppblog.com/cannot/</link><description>两个人的天空，一个人的世界。</description><language>zh-cn</language><lastBuildDate>Tue, 14 Apr 2026 23:06:12 GMT</lastBuildDate><pubDate>Tue, 14 Apr 2026 23:06:12 GMT</pubDate><ttl>60</ttl><item><title>Codeforces Round #154 div.2</title><link>http://www.cppblog.com/cannot/archive/2012/12/09/196127.html</link><dc:creator>icAnNot.exe</dc:creator><author>icAnNot.exe</author><pubDate>Sun, 09 Dec 2012 08:23:00 GMT</pubDate><guid>http://www.cppblog.com/cannot/archive/2012/12/09/196127.html</guid><wfw:comment>http://www.cppblog.com/cannot/comments/196127.html</wfw:comment><comments>http://www.cppblog.com/cannot/archive/2012/12/09/196127.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/cannot/comments/commentRss/196127.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/cannot/services/trackbacks/196127.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 【链接】http://www.codeforces.com/contest/253【A. Boys and Girls】【题目大意】让N个男孩，M个女孩排在一行，使得相邻的孩子（i &amp;&amp; i+1）性别不同的个数最大【参考算法】让男孩和女孩相间排列显然是一种比较优秀的选择。如果男孩比女孩多，那么先排男孩，然后女孩，直到女孩都被领走了，后面排剩下的男孩。反之相同。【小结】No？【参考代...&nbsp;&nbsp;<a href='http://www.cppblog.com/cannot/archive/2012/12/09/196127.html'>阅读全文</a><img src ="http://www.cppblog.com/cannot/aggbug/196127.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/cannot/" target="_blank">icAnNot.exe</a> 2012-12-09 16:23 <a href="http://www.cppblog.com/cannot/archive/2012/12/09/196127.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>First day~</title><link>http://www.cppblog.com/cannot/archive/2011/11/02/159519.html</link><dc:creator>icAnNot.exe</dc:creator><author>icAnNot.exe</author><pubDate>Wed, 02 Nov 2011 09:47:00 GMT</pubDate><guid>http://www.cppblog.com/cannot/archive/2011/11/02/159519.html</guid><wfw:comment>http://www.cppblog.com/cannot/comments/159519.html</wfw:comment><comments>http://www.cppblog.com/cannot/archive/2011/11/02/159519.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/cannot/comments/commentRss/159519.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/cannot/services/trackbacks/159519.html</trackback:ping><description><![CDATA[<div>I&#8216;m cAnNot，a student of buaa~&nbsp;I love&nbsp;coding and computer games . I'm glad to make friends with you~</div><img src ="http://www.cppblog.com/cannot/aggbug/159519.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/cannot/" target="_blank">icAnNot.exe</a> 2011-11-02 17:47 <a href="http://www.cppblog.com/cannot/archive/2011/11/02/159519.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>