2016年7月20日

UVA548(二叉树遍历)

摘要： You are to determine the value of the leaf node in a given binary tree that is the terminal node of apath of least value from the root of the binary t 阅读全文

posted @ 2016-07-20 16:20 vCoders 阅读(191) 评论(0) 推荐(0) 编辑

HDU4006(小根堆)

摘要： The kth great number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 9780 Accepted Submission(s): 阅读全文

posted @ 2016-07-20 14:51 vCoders 阅读(163) 评论(0) 推荐(0) 编辑

HDU4825(字典树+贪心)

摘要： Xor Sum Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 1245 Accepted Submission(s): 517 Proble 阅读全文

posted @ 2016-07-20 09:33 vCoders 阅读(290) 评论(0) 推荐(0) 编辑

导航