2013年8月10日

POJ 1451 T9

摘要： T9Time Limit:1000MSMemory Limit:10000KTotal Submissions:3083Accepted:1101DescriptionBackgroundA while ago it was quite cumbersome to create a message for the Short Message Service (SMS) on a mobile phone. This was because you only have nine keys and the alphabet has more than nine letters, so most c 阅读全文

posted @ 2013-08-10 19:59 lzm风雨无阻 阅读(390) 评论(0) 推荐(0) 编辑

POJ 1330 Nearest Common Ancestors

摘要： Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:14698Accepted:7839DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below:In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the 阅读全文

posted @ 2013-08-10 15:20 lzm风雨无阻 阅读(613) 评论(0) 推荐(0) 编辑

POJ 1661 Help Jimmy

摘要： Help JimmyTime Limit:1000MSMemory Limit:10000KTotal Submissions:8011Accepted:2549Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimmy每次下落的高度不能超过MAX米，不然就会 阅读全文

posted @ 2013-08-10 12:26 lzm风雨无阻 阅读(459) 评论(0) 推荐(1) 编辑

导航