![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
zoj
ujn20161222
persistence
展开
-
2018_2_3A Stack or A Queue?_栈队列基础题
Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.Here comes the problem:原创 2018-02-03 17:58:29 · 219 阅读 · 0 评论 -
How Many Trees?_BST递推_2018_2_20
How Many Trees? Time Limit: 2 Seconds Memory Limit: 65536 KB The balanced binary tree...原创 2018-02-20 19:02:29 · 178 阅读 · 0 评论 -
Decode the Tree_priority_queue_STL_2018_2_19
A tree (i.e. a connected graph without cycles) with vertices numbered by the integers 1, 2, ..., n is given. The "Prufer" code of such a tree is built as follows: the leaf (a vertex that is incident t...原创 2018-02-19 15:57:25 · 150 阅读 · 0 评论 -
Windows Message Queue_优先队列_2018_2_18
Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text change, the system wil...原创 2018-02-18 20:25:11 · 154 阅读 · 0 评论 -
2018_2_7_Ananagrams _字典_字符串
https://vjudge.net/problem/UVA-156#include#include#include#include #include#include#include using namespace std;struct AA{ string s; string t; AA(char c[]){ s=c; for(int i=0;i<strlen(c原创 2018-02-07 20:31:45 · 128 阅读 · 0 评论 -
2018_2_13_Directory Listing_树_链表
Directory Listing Time Limit: 2 Seconds Memory Limit: 65536 KB Given a tree of UNIX d...原创 2018-02-13 14:01:28 · 119 阅读 · 0 评论 -
2018_2_7_Stack By Stack _记忆递归升级_哈希
注意long longThere are n stacks, named in order S[1], S[2], S[3], ... ,S[n]. Initially, all of them are empty. The following process ends when S[n] is full.If non of the stacks is full, S[1] is原创 2018-02-07 12:26:34 · 208 阅读 · 0 评论 -
2018_2_13_Family Tree_树_层次结构
Family Tree Time Limit: 2 Seconds Memory Limit: 65536 KB A professor of anthropology was interest...原创 2018-02-13 11:14:55 · 467 阅读 · 0 评论 -
2018_2_5_Anagrams by Stack_栈_模拟_回溯_递归
How can anagrams result from sequences of stack operations? There are two sequences of stack operators which can convert TROT to TORT:[ i i i i o o o o i o i i o o i o ] where i stands原创 2018-02-05 08:38:42 · 197 阅读 · 0 评论 -
Power Network_网络流基础题_2018_3_17
Power Network Time Limit: 5 Seconds Memory Limit: 32768 KB A power network consists of nodes (pow...原创 2018-03-17 16:49:50 · 262 阅读 · 0 评论