数据结构基础
文章平均质量分 91
苏摩夜
持之以恒
展开
-
UVA - 12657 Boxes in a Line
#include #include using namespace std;int r[100010];int l[100010]; void link(int x,int y) { l[y]=x; r[x]=y; } void moveleft(int x,int y) { link(l[x],r[x]); link(l[y],x)原创 2014-08-20 08:37:24 · 677 阅读 · 0 评论 -
UVA - 673 Parentheses Balance
You are given a string consisting of parentheses () and []. A string of this type is said to becorrect: (a) if it is the empty string (b) if A and B are correct, AB is correct, (c) if A is correct原创 2014-08-15 10:28:50 · 456 阅读 · 0 评论 -
UVA - 297 Quadtrees
A quadtree is a representation format used to encode images. The fundamental idea behind the quadtree is that any image can be split into four quadrants. Each quadrant may again be split in four sub q原创 2014-08-17 19:14:21 · 378 阅读 · 0 评论 -
UVA - 10050 Hartals
A social research organization has determined a simple set of parameters to simulate the behavior of the political parties of our country. One of the parameters is a positive integerh (called the ha原创 2014-08-16 15:55:20 · 382 阅读 · 0 评论 -
UVA - 11111 Generalized Matrioshkas
Vladimir worked for years making matrioshkas, those nesting dolls that certainly represent truly Russian craft. A matrioshka is a doll that may be opened in two halves, so that one finds another doll原创 2014-08-15 18:48:30 · 438 阅读 · 0 评论 -
UVA - 10152 ShellSort
Problem D: ShellSort He made each turtle stand on another one's backAnd he piled them all up in a nine-turtle stack.And then Yertle climbed up. He sat down on the pile.What a wonderful view! H原创 2014-08-15 09:38:09 · 362 阅读 · 0 评论 -
UVA - 514 Rails
There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to e原创 2014-08-13 15:45:06 · 334 阅读 · 0 评论 -
UVA - 10935 Throwing cards away I
Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and cardn at the bottom. The following operation is performed as long as there are at least two cards in the deck:Throw a原创 2014-08-13 14:31:21 · 496 阅读 · 0 评论 -
UVA - 679 Dropping Balls
A number of K balls are dropped one by one from the root of a fully binary tree structure FBT. Each time the ball being dropped first visits a non-terminal node. It then keeps moving down, either foll原创 2014-08-14 15:22:35 · 486 阅读 · 0 评论 -
UVA - 540 Team Queue
Queues and Priority Queues are data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it occurs often in everyday life. At lunch time the q原创 2014-08-16 10:52:59 · 393 阅读 · 0 评论 -
UVA - 327 Evaluating Simple C Expressions
The task in this problem is to evaluate a sequence of simple C expressions, buy you need not know C to solve the problem! Each of the expressions will appear on a line by itself and will contain no mo原创 2014-08-18 18:59:11 · 506 阅读 · 0 评论 -
UVA - 839 Not so Mobile
Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small原创 2014-08-18 20:32:33 · 430 阅读 · 0 评论 -
UVA - 442 Matrix Chain Multiplication
Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices.Since matrix multiplication is associative, the order in which multiplications are performed isarbitrary. How原创 2014-08-15 15:12:28 · 403 阅读 · 0 评论 -
UVA - 548 Tree
You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum o原创 2014-08-17 14:24:41 · 461 阅读 · 0 评论 -
UVA - 699 The Falling Leaves
Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing ha原创 2014-08-18 14:28:05 · 359 阅读 · 0 评论 -
UVA - 133 The Dole Queue
In a serious attempt to downsize (reduce) the dole queue, The New National Green Labour Rhinoceros Party has decided on the following strategy. Every day all dole applicants will be placed in a large原创 2014-08-14 19:37:28 · 398 阅读 · 0 评论 -
UVA - 101 The Blocks Problem
Background Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world原创 2014-08-14 14:18:20 · 442 阅读 · 0 评论 -
UVA - 127 "Accordian" Patience
ou are to simulate the playing of games of ``Accordian'' patience, the rules for which are as follows:Deal cards one by one in a row from left to right, not overlapping. Whenever the card matches it原创 2014-08-14 09:30:31 · 493 阅读 · 0 评论 -
UVA - 11234 Expressions
Problem E: ExpressionsArithmetic expressions are usually written with the operators in between the two operands (which is called infix notation). For example,(x+y)*(z-w) is an arithmetic express原创 2014-08-16 08:37:16 · 420 阅读 · 0 评论 -
UVA - 112 Tree Summing
BackgroundLISP was one of the earliest high-level programming languages and, with FORTRAN, is one of the oldest languages currently being used. Lists, which are the fundamental data structures in LI原创 2014-08-16 20:08:03 · 414 阅读 · 0 评论 -
UVA - 712 S-Trees
A Strange Tree (S-tree) over the variable set is a binary tree representing a Boolean function . Each path of the S-tree begins at the root node and consists of n+1 nodes. Each of the S-tree's node原创 2014-08-18 10:00:48 · 397 阅读 · 0 评论 -
UVA - 122 Trees on the level
BackgroundTrees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fu原创 2014-08-17 09:22:28 · 395 阅读 · 0 评论