Uva
文章平均质量分 83
Blue_Nocturne
这个作者很懒,什么都没留下…
展开
-
Uva10881 - Piotr's Ants(蚂蚁)
这是一个等效变换问题,感觉解法还是蛮叼的。应注意记录输入次序;在按照Pos从大到小排序后,用一个数组存储输入次序;在对Pos进行T的+/-后,重新按照Pos排序并将存储的输入次序附回原位(结构体中的位置)——以此表示变换后的该位置的结构体依然是第一次排序后的对象)最后按输入次序输入。#include using namespace std;#include typedef原创 2015-06-18 20:16:31 · 440 阅读 · 0 评论 -
Uva-816 - Abbott's Revenge
InputThe input file will consist of one or more arrow mazes. The first line of each maze description containsthe name of the maze, which is an alphanumeric string of no more than 20 characters. The原创 2015-09-04 18:38:56 · 864 阅读 · 0 评论 -
Uva-572 - Oil Deposits(DFS)
Oil Deposits The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creat原创 2015-09-01 17:19:34 · 350 阅读 · 0 评论 -
Uva-297 - Quadtrees(四分树与结构体指针)
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原创 2015-08-31 18:26:42 · 725 阅读 · 0 评论 -
Uva-548-Tree(二叉树与stream与dfs)
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原创 2015-08-30 16:23:45 · 346 阅读 · 0 评论 -
Uva-839 - Not so Mobile
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 han原创 2015-08-30 17:10:03 · 394 阅读 · 0 评论 -
Uva-699 - The Falling Leaves(二叉树与递归)
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原创 2015-08-30 22:06:57 · 437 阅读 · 0 评论 -
Uva-679 - Dropping Balls(二叉树)
Dropping BallsDropping 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 no原创 2015-08-28 13:04:40 · 440 阅读 · 0 评论 -
Uva-122 - Trees on the level(二叉树与set)
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 tr原创 2015-08-28 20:13:39 · 394 阅读 · 0 评论 -
Uva-12657 Boxes in a Line(双向链表)
注意操作3是通过数字寻找位置的,不会受是否翻转的影响#include #include using namespace std;#define BG 100005int be[BG],ne[BG];int w=1;int main(){ int n,m; while(scanf("%d%d",&n,&m)!=EOF) { int i;原创 2015-08-24 20:59:36 · 369 阅读 · 0 评论 -
Uva-11988 - Broken Keyboard (a.k.a. Beiju Text)(链表)
You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problemwith the keyboard is that sometimes the “home” key or the “end” key gets automatically pressed(internal原创 2015-08-24 18:40:09 · 472 阅读 · 0 评论 -
uva 10137 The Trip
DescriptionA number of students are members of a club that travels annually to exotic locations. Their destinations in the past have included Indianapolis, Phoenix, Nashville, Philadelphia, San Jose, a原创 2017-03-02 14:18:19 · 558 阅读 · 1 评论