- 博客(15)
- 收藏
- 关注
RSS订阅原创 UVA 699（二叉树建树与遍历）
M - The Falling LeavesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2014-02-08)Description
2014-05-30 15:19:27
991
原创 UVA 712(二叉树模拟)
L - S-TreesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2014-04-01)Description S-Tree
2014-05-30 15:15:06
892
原创 UVA 297 Quadtrees（四叉树建树、合并与遍历）
K - QuadtreesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2014-01-02)Description Quadt
2014-05-29 18:05:21
1904
原创 UVA 548（二叉树重建与遍历）
J - TreeTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2014-05-16)Description Tree
2014-05-29 17:54:22
1687
3
原创 UVA 112（二叉树、DFS）
I - Tree SummingCrawling failedSubmit StatusAppoint description: System Crawler (2014-05-29)Description Tree Summing BackgroundLISP was one of the
2014-05-29 17:50:04
882
原创 UVA 540(队列）
Description Team Queue Queues and Priority Queues are data structures which are known to most computer scientists. The Team Queue, however, is not so well known, though
2014-05-29 17:45:18
1250
原创 三个水杯（BFS）
三个水杯时间限制：1000 ms | 内存限制：65535 KB难度：4描述给出三个水杯，大小不一，并且只有最大的水杯的水是装满的，其余两个为空杯子。三个水杯之间相互倒水，并且水杯没有标识，只能根据给出的水杯体积来计算。现在要求你写出一个程序，使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数N(0接下来每组测试数据有两行，第一行给出三
2014-05-25 00:49:47
1223
原创 poj 2021 优先队列bfs
Relative RelativesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3438 Accepted: 1507DescriptionToday is Ted's 100th birthday. A few weeks ago, you were
2014-05-19 20:58:04
1007
原创 UVA 442（栈的应用）
F - Matrix Chain MultiplicationTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2013-05-30)Description
2014-05-19 18:49:46
686
原创 UVA 673(括号匹配）
Description You are given a string consisting of parentheses () and []. A string of this type is said to be correct:(a)if it is the empty string(b)if A and B are correct, AB is correct,(c)
2014-05-19 18:42:47
1035
原创 UVA 133(循环链表)
C - The Dole QueueTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription The Dole Queue In a serious attempt to down
2014-05-16 15:08:43
1265
原创 UVA 101(栈模拟）
B - The Blocks ProblemTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusAppoint description: System Crawler (2014-03-05)Description
2014-05-14 18:12:23
870
转载 字典树
Trie树分类： 数据结构2012-08-08 19:26 654人阅读 评论(0) 收藏 举报nulldeleteinsertstruct搜索引擎存储定义：Trie树是一种哈希树的变种，又称字典树，单词查找树或者前缀树，用于保存大量的字符串，是一种用于快速检索的多叉树结构(如英文字母的字典树是一个26叉树，数字的字典树是一个10叉树)。例如：假设词典由下面
2014-05-13 13:54:00
627
原创 石子合并（区间dp）
石子合并（一）时间限制：1000 ms | 内存限制：65535 KB难度：3描述 有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为一堆。求出总的代价最小值。输入有多组测试数据，输入到文件结束。每组测试数据第一行有一个整
2014-05-10 00:22:30
936
原创 UVA 10025（数学）
The ? 1 ? 2 ? ... ? n = k problem The problemGiven the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k? 1 ? 2 ? ... ? n =
2014-05-08 23:57:30
1083
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人