Shawn_Ji

2015年8月15日

摘要：原题:DescriptionLetxandybe two strings over some finite alphabetA. We would like to transformxintoyallowing only operations given below:Deletion:a lette... 阅读全文

posted @ 2015-08-15 17:16 Shawn_Ji 阅读(181) 评论(0) 推荐(0) 编辑

HDU 1069 Monkey and Banana 解题心得

摘要：原题:Description一组研究人员正在设计一项实验，以测试猴子的智商。他们将挂香蕉在建筑物的屋顶，同时，提供一些砖块给这些猴子。如果猴子足够聪明，它应当能够通过合理的放置一些砖块建立一个塔，并爬上去吃他们最喜欢的香蕉。研究人员有n种类型的砖块，每种类型的砖块都有无限个。第i块砖块的长宽高分别用... 阅读全文

posted @ 2015-08-15 17:12 Shawn_Ji 阅读(326) 评论(0) 推荐(0) 编辑

Hdu_1003_Max Sum 解题心得

摘要：原题：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... 阅读全文

posted @ 2015-08-15 17:04 Shawn_Ji 阅读(135) 评论(0) 推荐(0) 编辑

2015年8月7日

CodeForces 18C - Stripe 解题心得

摘要：原题：DescriptionOnce Bob took a paper stripe ofnsquares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly nega... 阅读全文

posted @ 2015-08-07 20:41 Shawn_Ji 阅读(156) 评论(0) 推荐(0) 编辑

UVALive - 2519 Radar Installation 解题心得

摘要：原题：DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locati... 阅读全文

posted @ 2015-08-07 20:38 Shawn_Ji 阅读(459) 评论(0) 推荐(0) 编辑

CodeForces 492B Vanya and Lanterns 解题心得

摘要：原题：DescriptionVanya walks late at night along a straight street of lengthl, lit bynlanterns. Consider the coordinate system with the beginning of the ... 阅读全文

posted @ 2015-08-07 20:36 Shawn_Ji 阅读(16) 评论(0) 推荐(0) 编辑

HDU 4911 Inversion - 疯狂的癫子解题心得

摘要：原题：Descriptionbobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacentnumbers for no more than k times.Find the minimum number of inversions ... 阅读全文

posted @ 2015-08-07 20:32 Shawn_Ji 阅读(563) 评论(0) 推荐(0) 编辑

UVa 10382 - Watering Grass 解题心得

摘要：原题：nsprinklers are installed in a horizontal strip ofgrasslmeters long andwmeters wide. Each sprinkler is installed at the horizontal center line of t... 阅读全文

posted @ 2015-08-07 20:00 Shawn_Ji 阅读(266) 评论(0) 推荐(0) 编辑

UVA 10020 - Minimal coverage 解题心得

摘要：原题：The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would ... 阅读全文

posted @ 2015-08-07 19:55 Shawn_Ji 阅读(212) 评论(0) 推荐(0) 编辑

POJ3122-Pie 解题心得

摘要：原题：DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of va... 阅读全文

posted @ 2015-08-07 19:52 Shawn_Ji 阅读(222) 评论(0) 推荐(0) 编辑

公告