Re-moved

Problem Description 判断两序列是否为同一二叉搜索树序列   Input 开始一个数n，(1   Output 如果序列相同则输出YES，否则输出NO   Sample Input 2 567432 543267 576342 0   Sample Output YES NO

咸鱼区间线段树

线段树区间更新的一点微小的工作~

畅通工程 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 26432    Accepted Submission(s): 11550 Problem Description 省政府“畅通工程”的目标是使全省任何两

#include using namespace std; int pre[1050]; int find(int x){ return pre[x]==x?x:pre[x]=find(pre[x]); //寻找根结点的递归 } int main(){ int m,n; int a,b; int f1,f2; int total; while(scanf("%d",&n)&&

并查集~

Problem Description 上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路

Problem Description It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company. As is known to all, every stuff in a company has a title

Problem Description The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height? The radius of the cup’s top and bo

前m大的数 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17191    Accepted Submission(s): 5866 Problem Description 还记得Gardon给小希布置的那个作业

Basic Data Structure Time Limit: 7000/3500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 406    Accepted Submission(s): 115 Problem Description Mr. Fro

Problem Description Matrix multiplication problem is a typical example of dynamical programming.  Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Sinc

Problem Description There is a complete binary tree with N nodes.The subtree of the node i has Ai nodes.How many distinct numbers are there of Ai?   Input There are multiple test cases,

Description You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of

Description An array of size n ≤ 10 6 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the

Problem Description C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视

Problem Description A stack is a data structure in which all insertions and deletions of entries are made at one end, called the "top" of the stack. The last entry which is inserted is the first on

Problem Description Xiao Ming and Xiao Bao are playing a simple Numbers game. In a round Xiao Ming can choose to write down a number, or ask Xiao Bao what the kth great number is. Because the numbe

Problem Description The annual Games in frogs' kingdom started again. The most famous game is the Ironfrog Triathlon. One test in the Ironfrog Triathlon is jumping. This project requires the frog a