摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a hill with n holes around. The holes are signed ... 阅读全文
posted @ 2015-08-18 21:27 lee是美少女 阅读(235) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescriptionTomorrow is contest day, Are you all ready? We have been training for 4... 阅读全文
posted @ 2015-08-18 21:14 lee是美少女 阅读(452) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription 小明对数的研究比较热爱,一谈到数,脑子里就涌现出好多数的问题,今天,小明想考考你对素数的认识。 问题是这样的:一个十进制数,如果是素数... 阅读全文
posted @ 2015-08-17 21:29 lee是美少女 阅读(182) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1458DescriptionA subsequence of a given sequence is the... 阅读全文
posted @ 2015-08-14 21:08 lee是美少女 阅读(124) 评论(0) 推荐(0) 编辑
摘要: ime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluDescriptionThe people of Mohammadpur have decided to paint each of their houses red, g... 阅读全文
posted @ 2015-08-14 20:44 lee是美少女 阅读(130) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionThe world financial crisis is quite a subject. Some people are more rel... 阅读全文
posted @ 2015-08-14 20:25 lee是美少女 阅读(138) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescription一组研究人员正在设计一项实验,以测试猴子的智商。他们将挂香蕉在建筑物的屋顶,同时,提供一些砖块给这些猴子。如果猴子足够聪明,它应当能够通过合理的放... 阅读全文
posted @ 2015-08-12 15:58 lee是美少女 阅读(160) 评论(0) 推荐(0) 编辑
摘要: A - 最大子段和Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a sequence a[1],a[2],a[3]......a[n], your j... 阅读全文
posted @ 2015-08-11 16:24 lee是美少女 阅读(204) 评论(0) 推荐(0) 编辑
摘要: DescriptionOnce Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negat... 阅读全文
posted @ 2015-08-08 15:52 lee是美少女 阅读(141) 评论(0) 推荐(0) 编辑
摘要: Descriptionbobo has a sequence a 1,a 2,…,a n. He is allowed to swap two adjacent numbers for no more than k times. Find the minimum number of inversio... 阅读全文
posted @ 2015-08-08 15:31 lee是美少女 阅读(270) 评论(0) 推荐(0) 编辑