2013年8月24日

POJ 3468 A Simple Problem with Integers (splay tree入门)

摘要: A Simple Problem with IntegersTime Limit:5000MSMemory Limit:131072KTotal Submissions:47944Accepted:14122Case Time Limit:2000MSDescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interv 阅读全文

posted @ 2013-08-24 23:16 kuangbin 阅读(1321) 评论(0) 推荐(0)

1588: [HNOI2002]营业额统计 (splay tree)

摘要: 1588: [HNOI2002]营业额统计Time Limit:5 SecMemory Limit:162 MBSubmit:5783Solved:1859[Submit][Status]Description营业额统计 Tiger最近被公司升任为营业部经理,他上任后接受公司交给的第一项任务便是统计并分析公司成立以来的营业情况。 Tiger拿出了公司的账本,账本上记录了公司成立以来每天的营业额。分析营业情况是一项相当复杂的工作。由于节假日,大减价或者是其他情况的时候,营业额会出现一定的波动,当然一定的波动是能够接受的,但是在某些时候营业额突变得很高或是很低,这就证明公司此时的经营状况出现了问题 阅读全文

posted @ 2013-08-24 22:08 kuangbin 阅读(828) 评论(0) 推荐(0)

HDU 4597 Play Game (DP,记忆化搜索)

摘要: Play GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 24Accepted Submission(s): 18Problem DescriptionAlice and Bob are playing a game. There are two piles of cards. There are N cards in each pile, and each card has a score. They take turns to pi 阅读全文

posted @ 2013-08-24 18:41 kuangbin 阅读(1759) 评论(0) 推荐(0)

HDU 4499 Cannon (搜索)

摘要: CannonTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 21Accepted Submission(s): 14Problem DescriptionIn Chinese Chess, there is one kind of powerful chessmen called Cannon. It can move horizontally or vertically along the chess grid. At each move, 阅读全文

posted @ 2013-08-24 18:39 kuangbin 阅读(880) 评论(0) 推荐(0)

HDU 4497 GCD and LCM (合数分解)

摘要: GCD and LCMTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 40Accepted Submission(s): 22Problem DescriptionGiven two positive integers G and L, could you tell me how many solutions of (x, y, z) there are, satisfying that gcd(x, y, z) = G and lcm(x, 阅读全文

posted @ 2013-08-24 18:37 kuangbin 阅读(2276) 评论(3) 推荐(0)

HDU 4496 D-City (并查集,水题)

摘要: D-CityTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 18Accepted Submission(s): 15Problem DescriptionLuxer is a really bad guy. He destroys everything he met.One day Luxer went to D-city. D-city has N D-points and M D-lines. Each D-line connects ex 阅读全文

posted @ 2013-08-24 18:31 kuangbin 阅读(1204) 评论(0) 推荐(1)

HDU 4493 Tutor (水题)

摘要: TutorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 47Accepted Submission(s): 26Problem DescriptionLilin was a student of Tonghua Normal University. She is studying at University of Chicago now. Besides studying, she worked as a tutor teaching Chi 阅读全文

posted @ 2013-08-24 18:30 kuangbin 阅读(1019) 评论(1) 推荐(0)

HDU 4498 Function Curve (分段,算曲线积分)

摘要: Function CurveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 31Accepted Submission(s): 10Problem DescriptionGiven sequences of k1, k2, … kn, a1, a2, …, anand b1, b2, …, bn. Consider following function:Then we draw F(x) on a xy-plane, the value of 阅读全文

posted @ 2013-08-24 18:29 kuangbin 阅读(730) 评论(4) 推荐(1)

POJ 2417 Discrete Logging (Baby-Step Giant-Step)

摘要: Discrete LoggingTime Limit:5000MSMemory Limit:65536KTotal Submissions:2819Accepted:1386DescriptionGiven a prime P, 2 8 #include 9 #include 10 #include 11 #include 12 #include 13 #include 14 #include 15 #include 16 #include 17 #include 18 #include 19 using namespace std;20 //baby_step giant_step21 .. 阅读全文

posted @ 2013-08-24 00:35 kuangbin 阅读(1643) 评论(0) 推荐(0)

导航

JAVASCRIPT: