﻿<?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++博客-Xredman编程小筑-随笔分类-POJ</title><link>http://www.cppblog.com/xredman/category/10484.html</link><description /><language>zh-cn</language><lastBuildDate>Mon, 01 Jun 2009 11:45:48 GMT</lastBuildDate><pubDate>Mon, 01 Jun 2009 11:45:48 GMT</pubDate><ttl>60</ttl><item><title>POJ2808(校门外的树)</title><link>http://www.cppblog.com/xredman/archive/2009/05/31/86291.html</link><dc:creator>Xredman</dc:creator><author>Xredman</author><pubDate>Sun, 31 May 2009 09:43:00 GMT</pubDate><guid>http://www.cppblog.com/xredman/archive/2009/05/31/86291.html</guid><wfw:comment>http://www.cppblog.com/xredman/comments/86291.html</wfw:comment><comments>http://www.cppblog.com/xredman/archive/2009/05/31/86291.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xredman/comments/commentRss/86291.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xredman/services/trackbacks/86291.html</trackback:ping><description><![CDATA[<p style="FONT-SIZE: 14pt"><a href="http://poj.grids.cn/problem?id=2808">http://poj.grids.cn/problem?id=2808<br></a><span style="FONT-FAMILY: 楷体_GB2312">Problem:&nbsp; 2808&nbsp; Memory: 1932K&nbsp; Time: 32MS&nbsp;&nbsp;&nbsp; Language: C++&nbsp; Result: Accepted<br>看到这题首先会想到ZOJ的Color the ball，貌似有点线段树的感觉，看了教程后，终于决定直接模拟AC。</span><br></p>
<img src ="http://www.cppblog.com/xredman/aggbug/86291.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xredman/" target="_blank">Xredman</a> 2009-05-31 17:43 <a href="http://www.cppblog.com/xredman/archive/2009/05/31/86291.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ1657(Distance on Chessboard)</title><link>http://www.cppblog.com/xredman/archive/2009/05/31/86277.html</link><dc:creator>Xredman</dc:creator><author>Xredman</author><pubDate>Sun, 31 May 2009 08:45:00 GMT</pubDate><guid>http://www.cppblog.com/xredman/archive/2009/05/31/86277.html</guid><wfw:comment>http://www.cppblog.com/xredman/comments/86277.html</wfw:comment><comments>http://www.cppblog.com/xredman/archive/2009/05/31/86277.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xredman/comments/commentRss/86277.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xredman/services/trackbacks/86277.html</trackback:ping><description><![CDATA[<p style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312"><a href="http://acm.pku.edu.cn/JudgeOnline/problem?id=1657">http://acm.pku.edu.cn/JudgeOnline/problem?id=1657</a><br>Problem: 1657<br>Memory: 288K&nbsp;&nbsp;Time: 0MS<br>Language: C++&nbsp;&nbsp;Result: Accepted</p>
<p style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312">x = abs(s[0] - e[0])<br>y = abs(s[1] - e[1])</p>
<p style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312"><span style="COLOR: #ff0000">王：横、直、斜都可以走，但每步限走一格。</span><br>其步数为：max(x, y)</p>
<p style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312"><span style="COLOR: #ff0000">后:横、直、斜都可以走，每步格数不受限制。<br></span>其步数为：<br>&nbsp;&lt;1&gt;可以直走或斜走到达(x == y || x == 0 || y == 0) 1<br>&nbsp;&lt;2&gt; 2</p>
<p style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312"><span style="COLOR: #ff0000">车：横、竖均可以走，不能斜走，格数不限。 <br></span>其步数为<br>&nbsp;&lt;1&gt;可以直走到达(x == 0 || y == 0) 1<br>&nbsp;&lt;2&gt; 2</p>
<p style="FONT-SIZE: 14pt; FONT-FAMILY: 楷体_GB2312"><span style="COLOR: #ff0000">象：只能斜走，格数不限。<br></span>其步数为:<br>&nbsp;&lt;1&gt;斜走无法到达(abs(x - y) 为奇数) Inf<br>&nbsp;&lt;2&gt;一步斜走可以到达(x == y) 1<br>&nbsp;&lt;3&gt; 2<br><br><span style="COLOR: #0000ff">还有一种特殊情况：起点与终点相同</span></p>
<img src ="http://www.cppblog.com/xredman/aggbug/86277.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xredman/" target="_blank">Xredman</a> 2009-05-31 16:45 <a href="http://www.cppblog.com/xredman/archive/2009/05/31/86277.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ3461（Oulipo）</title><link>http://www.cppblog.com/xredman/archive/2009/05/10/82454.html</link><dc:creator>Xredman</dc:creator><author>Xredman</author><pubDate>Sun, 10 May 2009 02:00:00 GMT</pubDate><guid>http://www.cppblog.com/xredman/archive/2009/05/10/82454.html</guid><wfw:comment>http://www.cppblog.com/xredman/comments/82454.html</wfw:comment><comments>http://www.cppblog.com/xredman/archive/2009/05/10/82454.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xredman/comments/commentRss/82454.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xredman/services/trackbacks/82454.html</trackback:ping><description><![CDATA[<span style="FONT-SIZE: 18pt; FONT-FAMILY: 楷体_GB2312">/*<br>&nbsp;POJ3461(Oulipo)<br>&nbsp;Accepted 5108K 141MS C++ 901B 2009-05-10 09:48:46 <br>&nbsp;&nbsp;by Xredman<br>*/<br>&nbsp;本题为纯粹的KMP算法，其变化仅在于返回值不是匹配串首次在模式串中出现的位置，而是匹配串在模式串中出现的次数。 </span>
<img src ="http://www.cppblog.com/xredman/aggbug/82454.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xredman/" target="_blank">Xredman</a> 2009-05-10 10:00 <a href="http://www.cppblog.com/xredman/archive/2009/05/10/82454.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>