- 博客(3)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 POJ2309 BST
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repe
2014-08-03 11:25:22
1383
原创 Binary Tree
Description Background Binary trees are a common data structure in computer science. In this problem we will look at an infinite binary tree where the nodes contain a pair of integers. Th
2014-08-01 19:35:49
1128
原创 畅通工程
原文请访问：http://xiaoshig.sinaapp.com/?p=174 畅通工程 Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条
2014-08-01 10:18:14
1025
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人