ujn20161222的博客

life is like a box of chocolates you never know what you re gonna get

Power Network_网络流基础题_2018_3_17

Power Network Time Limit: 5 Seconds      Memory Limit: 32768 KB ...

2018-03-17 16:49:50

阅读数:12

评论数:0

How Many Trees?_BST递推_2018_2_20

How Many Trees? Time Limit: 2 Seconds      Memory Limit: 65536 KB ...

2018-02-20 19:02:29

阅读数:24

评论数: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 s...

2018-02-19 15:57:25

阅读数:18

评论数: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 proces...

2018-02-18 20:25:11

阅读数:21

评论数:0

2018_2_13_Directory Listing_树_链表

Directory Listing Time Limit: 2 Seconds      Memory Limit: 65536 KB ...

2018-02-13 14:01:28

阅读数:16

评论数:0

2018_2_13_Family Tree_树_层次结构

Family Tree Time Limit: 2 Seconds      Memory Limit: 65536 KB ...

2018-02-13 11:14:55

阅读数:36

评论数: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; strin...

2018-02-07 20:31:45

阅读数:11

评论数:0

2018_2_7_Stack By Stack _记忆递归升级_哈希

注意long long There 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]...

2018-02-07 12:26:34

阅读数:28

评论数: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...

2018-02-05 08:38:42

阅读数:19

评论数:0

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 ...

2018-02-03 17:58:29

阅读数:39

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭