10 2018 档案

HDU 2193 AVL Tree
摘要：AVL Tree An AVL tree is a kind of balanced binary search tree. Named after their inventors, Adelson-Velskii and Landis, they were the first dynamicall 阅读全文
posted @ 2018-10-31 23:52 suvvm 阅读(298) 评论(0) 推荐(1) 编辑
POJ 3481 Double Queue（set实现）
摘要：Double Queue The new founded Balkan Investment Group Bank (BIG-Bank) opened a new office in Bucharest, equipped with a modern computing environment pr 阅读全文
posted @ 2018-10-31 23:21 suvvm 阅读(387) 评论(0) 推荐(1) 编辑
sgu-203 Hyperhuffman（哈夫曼编码）
摘要：Hyperhuffman You might have heard about Huffman encoding - that is the coding system that minimizes the expected length of the text if the codes for c 阅读全文
posted @ 2018-10-30 23:54 suvvm 阅读(249) 评论(0) 推荐(1) 编辑
HDU 3999 The order of a Tree
摘要：The order of a Tree As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely: 1. insert a key k 阅读全文
posted @ 2018-10-30 23:34 suvvm 阅读(379) 评论(0) 推荐(1) 编辑
HDU 5444 Elven Postman （2015 ACM/ICPC Asia Regional Changchun Online）
摘要：Elven Postman Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be 阅读全文
posted @ 2018-10-30 17:30 suvvm 阅读(265) 评论(0) 推荐(1) 编辑
POJ 1577 Falling Leaves 二叉搜索树
摘要：HDU 3791 Falling Leaves 二叉搜索树 Figure 1Figure 1 shows a graphical representation of a binary tree of letters. People familiar with binary trees can ski 阅读全文
posted @ 2018-10-29 22:57 suvvm 阅读(349) 评论(0) 推荐(1) 编辑
HDU 3791 二叉搜索树
摘要：HDU 3791 二叉搜索树 判断两序列是否为同一二叉搜索树序列 Input开始一个数n，(1<=n<=20) 表示有n个需要判断，n= 0 的时候输入结束。 接下去一行是一个序列，序列长度小于10，包含(0~9)的数字，没有重复数字，根据这个序列可以构造出一颗二叉搜索树。 接下去的n行有n个序列， 阅读全文
posted @ 2018-10-29 21:44 suvvm 阅读(381) 评论(0) 推荐(1) 编辑

点击右上角即可分享
微信分享提示