MY Blog

Boring CountingTime Limit: 3000ms   Memory limit: 65536K  有疑问？点这里^_^题目描述    In this problem you are given a number sequence P consisting of N integer and Pi is the ith element in the seque

Team QueueTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3282 Accepted: 1188DescriptionQueues and Priority Queues are data structures which are known to

2238: 括号匹配(栈和队列)Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 42  Solved: 28[Submit][Status][Web Board]Description假设一个算术表达式中可以包含三种括号：圆括号“(”和“)”，方括号“[”和“]”和花括号“{”和“ ”，且这三种括号可按任意的次序嵌套使用（如：…

C - A Stack or A Queue?Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%lld & %lluSubmitStatusDescriptionDo you know stack and queue? They're both important data structure

Boolean ExpressionsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3665 Accepted: 1104DescriptionThe objective of the program you are going to produce i

1011: RailsTime Limit: 1000 Sec  Memory Limit:64 MBSubmit: 11  Solved: 6[Submit][Status][Web Board]DescriptionThere is a famous railway station in PopPush City. Country there is incredib

2755: C++习题-希尔排序Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 67  Solved: 49[Submit][Status][Web Board]Description  shell排序的基本思想是：  先取一个小于n的整数d1作为第一个增量，把文件的全部记录分成d1个组。所有距离为d1的倍数的记录放

题意：对于公式： a*x1^3+b*x2^3+c*x3^3+d*x4^3+e*x5^3=0其中（a，b，c，d，e，x1，x2，x3，x4，x5）都在区间【-50，50】中给出a，b，c，d，e求满足等式的情况分析：等式===》-（a*x1^3+b*x2^3)=c*x3^3+d*x4^3+e*x5^3又因为每个值范围在【-50，50】之间那么对于没一个数范围为【-1250000

题意：给1000个点，问其中任取4个点构成正方形的取法有多少种分析：我们知道通过一个正方形2个点可以确定另外两个点，那么我们只需要枚举这2个点就可以了。先把所有点hash然后枚举看是否存在这样的点已知： (x1,y1)  (x2,y2)则： x3=x1+(y1-y2)   y3= y1-(x1-x2) x4=x2+(y1-y2)   y4= y2-(x1-x2)或： x

Printer QueueTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4329 Accepted: 2269DescriptionThe only printer in the computer science students' union is exp

TreesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10123 Accepted: 6650DescriptionThe road off the east gate of Peking University used to be decorated w

Elven PostmanTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 379    Accepted Submission(s): 200Problem DescriptionElves are ve

Binary TreeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6411 Accepted: 2947DescriptionBackground Binary trees are a common data structure in comput

Tree GraftingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2049 Accepted: 901DescriptionTrees have many applications in computer science. Perhaps the

Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4621    Accepted Submission(s): 2101Problem DescriptionA b

二叉搜索树Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3584    Accepted Submission(s): 1575Problem Description判断两序列是否为同一二叉搜索树序列

A - Closest Common Ancestors（8.4.9）Time Limit:2000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionWrite a program that takes as input a rooted

Hire and FireTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2350 Accepted: 672DescriptionIn this problem, you are asked to keep track of the hierarchical

Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22015 Accepted: 11524DescriptionA rooted tree is a well-known data structure in co

题意：给你m*n的矩阵问每行取一个数构成一个含m个数的序列，求序列和最小的前n个序列的和分析：对于m等于一的情况那么显然降序输出第一行的数就是答案对于m等于二的情况：先读入第一行数据到一个堆中（堆的大小一直保持在n）对于第二行的数据：先把堆中的数取出来记为a【】；开始读入第二行的数据记为b【】；如果读入的是b【0】那么把a【k】+b【0】压入堆中如果读入的是b【j】