数据结构干瞪眼
蒟蒻的ACMer
2014界大学新生
展开
-
山东省第四届ACM大学生程序设计竞赛 Boring Counting 划分树
Boring Counting Time 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原创 2016-04-12 19:03:30 · 551 阅读 · 0 评论 -
POJ 2259 Team Queue 数据结构 队列
Team Queue Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3282 Accepted: 1188 Description Queues and Priority Queues are data structures which are known to原创 2015-08-18 16:14:35 · 1073 阅读 · 0 评论 -
YTU 2238: 括号匹配(栈和队列)
2238: 括号匹配(栈和队列) Time Limit: 1 Sec Memory Limit: 128 MB Submit: 42 Solved: 28 [Submit][Status][Web Board] Description 假设一个算术表达式中可以包含三种括号:圆括号“(”和“)”,方括号“[”和“]”和花括号“{”和“ ”,且这三种括号可按任意的次序嵌套使用(如:…原创 2015-08-18 10:41:51 · 1046 阅读 · 0 评论 -
ZOJ 3210 A Stack or A Queue ? 水
C - A Stack or A Queue? Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu SubmitStatus Description Do you know stack and queue? They're both important data structure原创 2015-08-17 15:26:18 · 1106 阅读 · 0 评论 -
POJ 2106 Boolean Expressions
Boolean Expressions Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 3665 Accepted: 1104 Description The objective of the program you are going to produce i原创 2015-08-17 15:09:00 · 1346 阅读 · 0 评论 -
YTU 1011 Rails 栈
1011: Rails Time Limit: 1000 Sec Memory Limit: 64 MB Submit: 11 Solved: 6 [Submit][Status][Web Board] Description There is a famous railway station in PopPush City. Country there is incredib原创 2015-06-30 19:05:24 · 634 阅读 · 0 评论 -
YTU 2755: C++习题-希尔排序
2755: C++习题-希尔排序 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 67 Solved: 49 [Submit][Status][Web Board] Description shell排序的基本思想是: 先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为d1的倍数的记录放原创 2015-06-03 09:25:06 · 593 阅读 · 0 评论 -
poj 1840 Eqs hash
题意: 对于公式: 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原创 2017-03-28 19:12:23 · 381 阅读 · 0 评论 -
poj 2002 has
题意: 给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原创 2017-03-29 12:20:02 · 372 阅读 · 0 评论 -
POJ 3125 Printer Queue 数据结构 队列
Printer Queue Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4329 Accepted: 2269 Description The only printer in the computer science students' union is exp原创 2015-08-18 18:49:23 · 1514 阅读 · 0 评论 -
POJ 2665 Trees 水
Trees Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10123 Accepted: 6650 Description The road off the east gate of Peking University used to be decorated w原创 2015-08-22 10:29:22 · 827 阅读 · 0 评论 -
HDU 5444&&长春网络赛1008 Elven Postman
Elven Postman Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 379 Accepted Submission(s): 200 Problem Description Elves are ve原创 2015-09-14 18:09:03 · 713 阅读 · 0 评论 -
POJ 2499 Binary Tree
Binary Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6411 Accepted: 2947 Description Background Binary trees are a common data structure in comput原创 2015-09-13 19:18:28 · 470 阅读 · 0 评论 -
POJ 3437 Tree Grafting
Tree Grafting Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 2049 Accepted: 901 Description Trees have many applications in computer science. Perhaps the原创 2015-09-13 16:20:09 · 507 阅读 · 0 评论 -
HDU 1710 Binary Tree Traversals
Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4621 Accepted Submission(s): 2101 Problem Description A b原创 2015-09-12 22:59:56 · 612 阅读 · 0 评论 -
HDU 3791 二叉搜索树
二叉搜索树 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3584 Accepted Submission(s): 1575 Problem Description 判断两序列是否为同一二叉搜索树序列原创 2015-09-12 18:14:38 · 465 阅读 · 0 评论 -
POJ 1470 Closest Common Ancestors 采用树结构的非线性表编程
A - Closest Common Ancestors(8.4.9) Time Limit:2000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description Write a program that takes as input a rooted原创 2015-08-25 20:11:42 · 729 阅读 · 0 评论 -
POJ 2003 Hire and Fire stl
Hire and Fire Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 2350 Accepted: 672 Description In this problem, you are asked to keep track of the hierarchical原创 2015-08-22 15:15:45 · 1259 阅读 · 0 评论 -
POJ 1330 Nearest Common Ancestors 树
Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 22015 Accepted: 11524 Description A rooted tree is a well-known data structure in co原创 2015-08-22 11:53:43 · 848 阅读 · 0 评论 -
poj 2442 Sequence 堆
题意: 给你m*n的矩阵问每行取一个数构成一个含m个数的序列,求序列和最小的前n个序列的和 分析: 对于m等于一的情况那么显然降序输出第一行的数就是答案 对于m等于二的情况:先读入第一行数据到一个堆中(堆的大小一直保持在n) 对于第二行的数据:先把堆中的数取出来记为a【】; 开始读入第二行的数据记为b【】; 如果读入的是b【0】那么把a【k】+b【0】压入堆中 如果读入的是b【j】原创 2017-03-29 14:17:37 · 303 阅读 · 0 评论