上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 94 下一页

2013年8月28日

BZOJ 1500: [NOI2005]维修数列 (splay tree)

摘要: 1500: [NOI2005]维修数列Time Limit:10 SecMemory Limit:64 MBSubmit:4229Solved:1283[Submit][Status]DescriptionInput输入文件的第1行包含两个数N和M,N表示初始时数列中数的个数,M表示要进行的操作数目。第2行包含N个数字,描述初始时的数列。以下M行,每行一条命令,格式参见问题描述中的表格。Output对于输入数据中的GET-SUM和MAX-SUM操作,向输出文件依次打印结果,每个答案(数字)占一行。Sample Input9 82 -6 3 5 1 -5 -3 6 3GET-SUM 5 4MAX 阅读全文

posted @ 2013-08-28 19:18 kuangbin 阅读(3388) 评论(0) 推荐(0) 编辑

2013年8月27日

BZOJ 1269: [AHOI2006]文本编辑器editor (splay tree)

摘要: 1269: [AHOI2006]文本编辑器editorTime Limit:10 SecMemory Limit:162 MBSubmit:1213Solved:454[Submit][Status]Description这些日子,可可不和卡卡一起玩了,原来可可正废寝忘食的想做一个简单而高效的文本编辑器。你能帮助他吗?为了明确任务目标,可可对“文本编辑器”做了一个抽象的定义:文本:由0个或多个字符构成的序列。这些字符的ASCII码在闭区间[32, 126]内,也就是说,这些字符均为可见字符或空格。光标:在一段文本中用于指示位置的标记,可以位于文本的第一个字符之前,文本的最后一个字符之后或文本的 阅读全文

posted @ 2013-08-27 03:05 kuangbin 阅读(1564) 评论(0) 推荐(0) 编辑

2013年8月26日

HDU 3487 Play with Chain (splay tree)

摘要: Play with ChainTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2783Accepted Submission(s): 1141Problem DescriptionYaoYao is fond of playing his chains. He has a chain containing n diamonds on it. Diamonds are numbered from 1 to n.At first, the diam 阅读全文

posted @ 2013-08-26 22:34 kuangbin 阅读(1030) 评论(0) 推荐(1) 编辑

2013年8月25日

HDU 3436 Queue-jumpers (splay tree)

摘要: Queue-jumpersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1821Accepted Submission(s): 425Problem DescriptionPonyo and Garfield are waiting outside the box-office for their favorite movie. Because queuing is so boring, that they want to play a ga 阅读全文

posted @ 2013-08-25 22:23 kuangbin 阅读(805) 评论(0) 推荐(0) 编辑

HDU 1890 Robotic Sort (splay tree)

摘要: Robotic SortTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1640Accepted Submission(s): 711Problem DescriptionSomewhere deep in the Czech Technical University buildings, there are laboratories for examining mechanical and electrical properties of v 阅读全文

posted @ 2013-08-25 11:07 kuangbin 阅读(1756) 评论(0) 推荐(0) 编辑

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 阅读(1315) 评论(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 阅读(812) 评论(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 阅读(1738) 评论(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 阅读(866) 评论(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 阅读(2247) 评论(3) 推荐(0) 编辑

上一页 1 ··· 9 10 11 12 13 14 15 16 17 ··· 94 下一页

导航

JAVASCRIPT: