数据结构
文章平均质量分 82
「已注销」
这个作者很懒,什么都没留下…
展开
-
牛客练习赛 8 (1~n约数和)(前缀和好题)(加边得连通图)(容斥原理)
A题目描述给个n,求1到n的所有数的约数个数的和~ 输入描述:第一行一个正整数n输出描述:输出一个整数,表示答案示例1输入3输出5说明样例解释:1有1个约数12有2个约数1,23有2个约数1,3备注:n <= 100000000#incl原创 2017-12-16 13:53:03 · 868 阅读 · 0 评论 -
HDU 5441 2015年长春icpc网络赛 并查集
TravelTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4204 Accepted Submission(s): 1408Problem DescriptionJack likes to travel原创 2017-11-30 10:52:29 · 289 阅读 · 0 评论 -
转载hdu 6059 字典树(好题要慢慢消化)2017 Multi-University Training Contest - Team 3
Kanade's trioTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 483 Accepted Submission(s): 163Problem DescriptionGive you an arra转载 2017-08-02 17:02:26 · 446 阅读 · 0 评论 -
zoj 1610 线段树,成段更新,查询有哪些段及其数量
Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.原创 2017-07-18 15:35:23 · 258 阅读 · 0 评论 -
poj 2528 特殊离散化+线段树
Mayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 65420 Accepted: 18911DescriptionThe citizens of Bytetown, AB, could not stand that the ca原创 2017-07-18 11:21:54 · 282 阅读 · 0 评论 -
F - City Park Gym - 100783F 计算几何+并查集
题意:给出许多个矩形,不重叠问连通的矩阵块面积最大是多少题解:因为没有重叠的,所以我们可以分别对水平线和垂直线进行并查集合并这里我犯了一个并查集的错误,就是在累加面积的时候写反了void Unite(int num1,int num2){ int tx=find_it(num1); int ty=find_it(num2); if(tx!=ty){原创 2017-06-07 01:35:21 · 640 阅读 · 1 评论 -
xtu oj 1238 线段树
做了我好长时间啊,这个线段树还是很经典的题意:四种操作,题目写的很清楚,就不说了,主要是这个题目对于操作2 3 用lazy标记很巧妙题解:线段树,lazy标记升级void pushDown(int p){ if(lazy[p]) { lazy[p<<1]+=lazy[p]; lazy[p<<1|1]+=lazy[p]原创 2017-04-17 13:24:52 · 690 阅读 · 0 评论 -
hdu 线段树 (矩形面积并+离散化+二分查找)
AtlantisTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11823 Accepted Submission(s): 4990Problem DescriptionThere are several an转载 2017-01-20 23:02:41 · 420 阅读 · 0 评论 -
hdu 1698 poj 3468 线段树 成段更新(lazy标记)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29678 Accepted Submission(s): 14649Problem DescriptionIn the game of D原创 2017-01-19 18:01:36 · 399 阅读 · 0 评论 -
线段树入门
BillboardTime Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20597 Accepted Submission(s): 8532Problem DescriptionAt the entrance to原创 2017-01-19 17:05:42 · 270 阅读 · 0 评论 -
hdu 5493 线段树(2015年合肥网络赛)
QueueTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1141 Accepted Submission(s): 589Problem DescriptionN people numbered from原创 2017-01-17 22:13:35 · 343 阅读 · 0 评论 -
poj 1386 并查集+有向欧拉通路
Play on WordsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11890 Accepted: 4061DescriptionSome of the secret doors contain a very interesting word p原创 2016-10-20 14:06:12 · 339 阅读 · 0 评论 -
poj 1797 并查集 / floyd(超时)
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 29437 Accepted: 7865DescriptionBackground Hugo Heavy is happy. After the breakdown原创 2016-08-03 17:01:39 · 556 阅读 · 0 评论 -
poj 2309 按位与 &(以x为根的满二叉搜索树的最小节点编号、最大节点编号)
1 & 1 = 10 & 1 = 00 & 0 = 0按位与就是那一位全部是 1 的时候是为 1 - x 表示为 x 的补码 +1 例如 x = 8时 : x 0 0 0 1 1 0 0 0 - x 1 1 1 0 1 0 0 0整数运算 x&(-x):原创 2016-07-31 18:22:10 · 630 阅读 · 0 评论 -
poj 2274 线段树+堆(优先队列)
The RaceTime Limit: 15000MS Memory Limit: 65536KTotal Submissions: 3685 Accepted: 756Case Time Limit: 3000MSDescriptionDuring the Annual Interstellar Comp原创 2016-07-31 10:35:38 · 1250 阅读 · 0 评论 -
poj1521 求赫夫曼编码长度
EntropyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7108 Accepted: 2661DescriptionAn entropy encoder is a data encoding method that achieves lossless原创 2016-07-27 21:06:02 · 649 阅读 · 0 评论 -
poj 2352 线段树 二分
StarsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41422 Accepted: 18050DescriptionAstronomers often examine star maps where stars are represented b原创 2016-07-27 15:32:11 · 356 阅读 · 0 评论 -
poj 2299 线段树
Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 54438 Accepted: 20002DescriptionIn this problem, you have to analyze a particular sorti转载 2016-07-27 10:44:09 · 428 阅读 · 2 评论 -
poj1577 二叉查找树复原,然后中序遍历输出
Falling LeavesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4521 Accepted: 2482Description Figure 1Figure 1 shows a graphical representation o原创 2016-07-26 16:35:38 · 1358 阅读 · 0 评论 -
poj 1182 推理 || 简单方法
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 62634 Accepted: 18380Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动转载 2016-07-24 19:52:36 · 386 阅读 · 0 评论 -
poj 1611 并查集
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 32831 Accepted: 15917DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu原创 2016-07-24 14:57:36 · 328 阅读 · 0 评论 -
poj 2403 简单并查集
Ubiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 31518 Accepted: 15276DescriptionThere are so many different religions in the world原创 2016-07-24 11:36:31 · 553 阅读 · 0 评论 -
poj1308 并查集
Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29041 Accepted: 9918DescriptionA tree is a well-known data structure that is either empty原创 2016-07-22 16:33:11 · 338 阅读 · 0 评论 -
poj 1988 并查集
Cube StackingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 23440 Accepted: 8219Case Time Limit: 1000MSDescriptionFarmer John and Betsy are pla原创 2016-07-21 23:09:52 · 378 阅读 · 0 评论 -
poj 1634 简单数据结构
Who's the boss?Time Limit: 5000MS Memory Limit: 30000KTotal Submissions: 2882 Accepted: 1174DescriptionSeveral surveys indicate that the taller you are, the hig原创 2016-07-20 16:40:39 · 699 阅读 · 0 评论 -
poj 2153 map简单应用
Rank ListTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 10365 Accepted: 3503DescriptionLi Ming is a good student. He always asks the teacher about h原创 2016-07-18 16:52:47 · 479 阅读 · 0 评论 -
poj3750单向循环链表
此题注意开始是从start开始数,但是后来都是从删除的接下来一个开始数,因此先要排除第start个之前的人然后就都是一个规律了,这里使用了c++的new和delete,直接获得一个指向结构体的指针#includestruct kids{ char name[20]; kids *next;};int main(){ int n; scanf("原创 2016-03-06 20:06:21 · 640 阅读 · 0 评论 -
poj2559单调栈
题意:在多个矩形中,已知这些矩形的宽度都为1,长度不完全相等,求在这些矩形按题给顺序排列能包括的范围内能得到的面积最大的矩形单调栈类型题目,所有元素各进栈和出栈各一次先按照从小到大排序,一旦有不满足的就把前面的元素踢出去,并且计算之前一个的最大面积,然后组合成一个新的,但是这个新的的宽是把之前的累加在一起的如果满足从小到大,就直接存在栈里面最后都把这些元素提出来,计原创 2016-03-08 21:10:41 · 415 阅读 · 0 评论 -
poj2082单调栈
和我的上一篇博客(poj2559单调栈)基本做法一致,就不多说了#include#includeusing namespace std;struct sets{ int high,wide;}data;int main(){ int n; while(scanf("%d",&n),n!=-1) { stackA;原创 2016-03-08 21:20:01 · 479 阅读 · 0 评论 -
poj 2513 欧拉回路+并查集+字典树
Colored SticksTime Limit: 5000MS Memory Limit: 128000KTotal Submissions: 35912 Accepted: 9388DescriptionYou are given a bunch of wooden sticks. Each endpoint of原创 2016-10-21 20:02:36 · 346 阅读 · 0 评论 -
2015长春区域赛hdu5534 异或字典树 | 暴力
Chip FactoryTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2310 Accepted Submission(s): 1007Problem DescriptionJohn is a原创 2016-10-21 08:46:01 · 671 阅读 · 0 评论 -
poj 1330 最近公共祖先
Nearest Common AncestorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25094 Accepted: 13049DescriptionA rooted tree is a well-known data structure i原创 2016-07-22 10:35:04 · 395 阅读 · 0 评论