2013年9月13日

不容易系列之(4)——考新郎

摘要： 不容易系列之(4)——考新郎Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 3Accepted Submission(s) : 1Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description 国庆期间,省城HZ刚刚举行了一场盛大的集体婚礼,为了使婚礼进行的丰富一些,司仪临时想出了有一个有意思的节目,叫做"考新郎",具体的操作是这样的:首先, 阅读全文

posted @ 2013-09-13 20:48 ~Love() 阅读(154) 评论(0) 推荐(0)

Design T-Shirt

摘要： Design T-ShirtTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4273Accepted Submission(s): 2076Problem DescriptionSoon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of sugge 阅读全文

posted @ 2013-09-13 18:52 ~Love() 阅读(187) 评论(0) 推荐(0)

Delta-wave

摘要： Delta-waveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4602Accepted Submission(s): 1745Problem DescriptionA triangle field is numbered with successive integers in the way shown on the picture below. The traveller needs to go from the cell with n 阅读全文

posted @ 2013-09-13 17:19 ~Love() 阅读(252) 评论(0) 推荐(0)

Max Sum

摘要： Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 115635Accepted Submission(s): 26817Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the ma 阅读全文

posted @ 2013-09-13 08:31 ~Love() 阅读(234) 评论(0) 推荐(0)

导航