<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ShallowDreamJY的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ShallowDreamJY</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ShallowDreamJY]]></copyright><item><title><![CDATA[百练1661:帮助 Jimmy（动态规划）]]></title><link>https://blog.youkuaiyun.com/ShallowDreamJY/article/details/113187257</link><guid>https://blog.youkuaiyun.com/ShallowDreamJY/article/details/113187257</guid><author>ShallowDreamJY</author><pubDate>Tue, 26 Jan 2021 19:09:07 +0800</pubDate><description><![CDATA[总时间限制:
1000ms
内存限制:
65536kB
描述
“Help Jimmy” 是在下图所示的场景上完成的游戏。
这里写图片描述
场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。
Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimmy每次下落的高度不能超过MAX米，不然就会摔死，游戏也会结束。
设计一个程序]]></description><category></category></item><item><title><![CDATA[ZOJ-1011 NTA]]></title><link>https://blog.youkuaiyun.com/ShallowDreamJY/article/details/112372827</link><guid>https://blog.youkuaiyun.com/ShallowDreamJY/article/details/112372827</guid><author>ShallowDreamJY</author><pubDate>Fri, 08 Jan 2021 17:15:24 +0800</pubDate><description><![CDATA[ZOJ-1011 NTA
Question Description:
NTA
Time Limit: 2000 msMemory Limit: 65536 KB
The NTA (Non-deterministic Tree Automata) is a kind of tree structure device. The device is built in a set of operating rules. With these rules the device can produce several ]]></description><category></category></item></channel></rss>