2013年5月23日
HDOJ 1087 Super Jumping! Jumping! Jumping!
摘要： d( i )=d( j ）『符合条件的0～i-1之间的最大的』+a[ i ]Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16601Accepted Submission(s): 7066Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is ve 阅读全文
posted @ 2013-05-23 23:11 码代码的猿猿 阅读(172) 评论(0) 推荐(0) 编辑
HDOJ 1209 Clock
摘要： 排序函数很坑爹。ClockTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3411Accepted Submission(s): 1048Problem DescriptionThere is an analog clock with two hands: an hour hand and a minute hand. The two hands form an angle. The angle is measured as the small 阅读全文
posted @ 2013-05-23 18:47 码代码的猿猿 阅读(165) 评论(0) 推荐(0) 编辑
HDOJ 1181 变形课
摘要： BFS就好了变形课Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 9011Accepted Submission(s): 3360Problem Description呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么的,但是他发现了变形咒语的一个统一规律:如果咒语是以a开头b结尾的一个单词,那么它的作用就恰好是使A物体变成B物体.Harry已经将他所会的所有咒语 阅读全文
posted @ 2013-05-23 01:34 码代码的猿猿 阅读(167) 评论(0) 推荐(0) 编辑
HDOJ 1029 Ignatius and the Princess IV
摘要： 编程之美2.3每次减去2个不同的值，到最后留下来的就是水王gnatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 12168Accepted Submission(s): 4848Problem Description"OK, you are not too bad, em... But you can never pass the next test." feng5166 sa 阅读全文
posted @ 2013-05-23 01:32 码代码的猿猿 阅读(143) 评论(0) 推荐(0) 编辑