仰望天空

03-树2. Tree Traversals Again (25)时间限制 200 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 CHEN, YueAn inorder binary tree traversal can be implemented

04-树4. Search in a Binary Search Tree (25)时间限制 100 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 CHEN, YueTo search a key in a binary search tree, we

We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer o

Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 37822 Accepted: 16111 DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehe

Squares Time Limit: 3500MS Memory Limit: 65536K Total Submissions: 18116 Accepted: 6946 DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-

Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 35803 Accepted: 9441 DescriptionYou may have heard that no two snowflakes are alike. Your task is to

Monthly Expense Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20086 Accepted: 7916 DescriptionFarmer John is an astounding accounting wizard and has realized he might run ou

题目You have N integers, A1, A2, … , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is to ask for the s

题目Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 17263 Accepted: 7966 DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of t

Colored Sticks Time Limit: 5000MS Memory Limit: 128000K Total Submissions: 33480 Accepted: 8787 DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some

Fence Repair Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 34676 Accepted: 11167 DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the

Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification: Each input file contains one test case. For each case, the first line gives

In 1953, David A. Huffman published his paper “A Method for the Construction of Minimum-Redundancy Codes”, and hence printed his name in the history of computer science. As a professor who gives the fi

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536K Total Submissions: 50482 Accepted: 18516 DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm process

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties: •The left subtree of a node contains only nodes with keys less than the node’s key. •The right

04-树3. Root of AVL Tree (25)时间限制 100 ms内存限制 65536 kB代码长度限制 8000 B判题程序 Standard 作者 CHEN, YueAn AVL tree is a self-balancing binary search tree. In an

Insert a sequence of given numbers into an initially empty min-heap H. Then for any given index i, you are supposed to print the path from H[i] to the root. Input Specification: Each input file contain

Eqs Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 14634 Accepted: 7181 DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+ a4x43+ a5x53=0 The coefficient

Gold Balanced Lineup Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 13606 Accepted: 3956 DescriptionFarmer John’s N cows (1 ≤ N ≤ 100,000) share many similarities. In fact, FJ has been

题目Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 38704 Accepted: 11915 DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actio