上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 53 下一页
摘要: A -AntsTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionYoung naturalist Bill studies ants in school. His ants feed on plant-louses that live on apple trees. Each ant colony needs its own apple tree to feed itself.Bill has a map with coordina 阅读全文
posted @ 2013-07-27 12:42 剑不飞 阅读(304) 评论(0) 推荐(0) 编辑
摘要: Warm upTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 955Accepted Submission(s): 193 Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel between any two pl 阅读全文
posted @ 2013-07-26 18:51 剑不飞 阅读(211) 评论(0) 推荐(0) 编辑
摘要: GameTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 336Accepted Submission(s): 92 Problem Description Nowadays, there are more and more challenge game on TV such as 'Girls, Rush Ahead'. Now, you participate int a game like this. There are 阅读全文
posted @ 2013-07-26 15:27 剑不飞 阅读(424) 评论(0) 推荐(0) 编辑
摘要: Palindrome Sub-ArrayTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 249Accepted Submission(s): 129 Problem Description A palindrome sequence is a sequence which is as same as its reversed order. For example, 1 2 3 2 1 is a palindrome sequence, bu. 阅读全文
posted @ 2013-07-26 13:21 剑不飞 阅读(290) 评论(0) 推荐(0) 编辑
摘要: Warm up 2Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 449Accepted Submission(s): 225 Problem Description Some 1×2 dominoes are placed on a plane. Each dominoe is placed either horizontally or vertically. It's guaranteed the dominoes in 阅读全文
posted @ 2013-07-26 12:47 剑不飞 阅读(221) 评论(0) 推荐(0) 编辑
摘要: DequeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 613Accepted Submission(s): 180 Problem DescriptionToday, the teacher gave Alice extra homework for the girl weren't attentive in his class. It's hard, and Alice is going to turn to you f 阅读全文
posted @ 2013-07-24 11:55 剑不飞 阅读(510) 评论(0) 推荐(0) 编辑
摘要: 本次的题就看了5题,其它的有的看了,有的没看懂,不提也。这是第一次的多校,刚开始就随便看题。后来有个对1Y了Partition就马上去看了下,果断感觉能出,应该是个找规律的题,打表找规律。打表时,还遇到了障碍。于是有手推了会。终于找了点规律,不过是个递推式,暂时没实用价值,看到有人喊倒3是水题,一看还真是,于是乎开是敲了。由于看的太匆忙还以为是范围是10^5就想也没想暴利打了个表,发现代码过长了,10^5 不让了,于是就把暴力交了,果断RE,仔细一看是数据长度是10^5,这明显就是模拟,于是重写了一下交了次PE居然忘给回车了。改了就过了。失误啊,后来还有一题Park Visit这个就是树的最长 阅读全文
posted @ 2013-07-23 20:32 剑不飞 阅读(180) 评论(0) 推荐(0) 编辑
摘要: SuccessorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1779Accepted Submission(s): 426 Problem DescriptionSean owns a company and he is the BOSS.The other Staff has one Superior.every staff has a loyalty and ability.Some times Sean will fire one 阅读全文
posted @ 2013-07-22 18:33 剑不飞 阅读(356) 评论(0) 推荐(0) 编辑
摘要: D -Draw and paintTime Limit:3000MSMemory Limit:98304KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4363DescriptionShadow is interested in the four-color theorem, now he wants to draw some lines on a rectangle paper to divide it into some parts, and then paint these parts with four differ 阅读全文
posted @ 2013-07-22 15:15 剑不飞 阅读(303) 评论(0) 推荐(0) 编辑
摘要: C -Dragon BallTime Limit:1500MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 4362DescriptionSean has got a Treasure map which shows when and where the dragon balls will appear. some dragon balls will appear in a line at the same time for each period.Since the time you 阅读全文
posted @ 2013-07-22 10:45 剑不飞 阅读(262) 评论(0) 推荐(0) 编辑
上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 53 下一页