
BST+treap+splay树
文章平均质量分 79
974792789
不要在能吃苦的年纪追求安逸。
展开
-
Black Box+POJ+treap树模板
Black Box Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7437 Accepted: 3051 Description Our Black Box represents a primitive database. It can save an int原创 2014-09-03 14:22:01 · 466 阅读 · 0 评论 -
Efficient Solutions+BST(排序二叉树)
Efficient Solutions Input: Standard Input Output: Standard Output "Our marriage ceremonies are solemn, sober moments of reflection; also regret, disagreement, argument and mutual recrimination原创 2014-09-02 19:03:36 · 451 阅读 · 0 评论 -
Permutation Transformer+uva+splay树
Permutation Transformer Time Limit: 2000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Description Permutation Transformer Write a p原创 2014-09-03 21:46:36 · 444 阅读 · 0 评论 -
Play with Chain+hdu+splay树的基本操作
Play with Chain Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4043 Accepted Submission(s): 1649 Problem Description YaoYao is fond原创 2014-11-23 21:31:42 · 513 阅读 · 0 评论 -
A Simple Problem with Integers+poj+splay树区间操作
A Simple Problem with Integers Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 66557 Accepted: 20467 Case Time Limit: 2000MS Description You have N i原创 2014-12-12 23:03:18 · 482 阅读 · 0 评论