上一页 1 ··· 4 5 6 7 8 9 下一页
摘要: 《概率》第一卷( 修订和补充第三版)施利亚耶夫著 周概荣译本 勘误 P8 表1-4 对照英文译本表格 P19 P20 P40 P41 本页最后一式子应为: P53 第12行 阅读全文
posted @ 2016-01-29 19:03 Cumulonimbus 阅读(782) 评论(0) 推荐(0) 编辑
摘要: Repair the Wall Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3076 Accepted Submission(s): 150 阅读全文
posted @ 2016-01-29 19:00 Cumulonimbus 阅读(205) 评论(0) 推荐(0) 编辑
摘要: Farm Irrigation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7897 Accepted Submission(s): 341 阅读全文
posted @ 2016-01-29 18:59 Cumulonimbus 阅读(112) 评论(0) 推荐(0) 编辑
摘要: 还是畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35208 Accepted Submission(s): 15877 Probl 阅读全文
posted @ 2016-01-29 18:57 Cumulonimbus 阅读(182) 评论(0) 推荐(0) 编辑
摘要: 畅通工程 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 41369 Accepted Submission(s): 21945 Problem 阅读全文
posted @ 2016-01-29 18:56 Cumulonimbus 阅读(127) 评论(0) 推荐(0) 编辑
摘要: 树状数组(Binary Indexed Tree,BIT)是能够完成下述操作的数据结构。 给一个初始值全为0的数列a1,a2,...,an; 给定i,计算a1+a2+...+ai 给定i和x,执行ai += x 基于线段树的实现 BIT的结构 BIT的求和 BIT的值的更新 BIT的复杂度 BIT的 阅读全文
posted @ 2016-01-27 22:55 Cumulonimbus 阅读(105) 评论(0) 推荐(0) 编辑
摘要: A + B Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14543 Accepted Submission(s): 8629 Problem 阅读全文
posted @ 2016-01-25 21:39 Cumulonimbus 阅读(127) 评论(0) 推荐(0) 编辑
摘要: 胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30841 Accepted Submission(s): 11509 Problem 阅读全文
posted @ 2016-01-25 21:36 Cumulonimbus 阅读(214) 评论(0) 推荐(0) 编辑
摘要: 变形课 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 19593 Accepted Submission(s): 7041 Problem D 阅读全文
posted @ 2016-01-25 21:34 Cumulonimbus 阅读(169) 评论(0) 推荐(0) 编辑
摘要: Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 23129 Accepted: 9012 Description You are trapped in a 3D dungeon and need to 阅读全文
posted @ 2016-01-25 21:32 Cumulonimbus 阅读(121) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 下一页