要努力成为别人的依赖 弱弱一枚 halfyarn
  半根毛线 计数er: AmazingCounters.com 位小伙伴来看过~

随笔分类 -  数据结构

Codeforces Round #305 (Div. 2) D 维护单调栈
摘要:D. Mike and Feet time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Mike is the president of 阅读全文
posted @ 2017-07-29 22:42 半根毛线 阅读(226) 评论(0) 推荐(0) 编辑
玲珑杯”ACM比赛 Round #19 B 维护单调栈
摘要:1149 - Buildings Time Limit:2s Memory Limit:128MByte Submissions:588Solved:151 1149 - Buildings Time Limit:2s Memory Limit:128MByte Submissions:588Sol 阅读全文
posted @ 2017-07-29 16:56 半根毛线 阅读(247) 评论(0) 推荐(0) 编辑
Codeforces Round #419 (Div. 2) A B C 暴力 区间更新技巧 +前缀和 模拟
摘要:A. Karen and Morning time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output A. Karen and Mornin 阅读全文
posted @ 2017-06-18 11:26 半根毛线 阅读(465) 评论(0) 推荐(0) 编辑
HDU 4348 主席树区间更新
摘要:To the moon Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5117 Accepted Submission(s): 1152 Pro 阅读全文
posted @ 2017-03-05 18:02 半根毛线 阅读(483) 评论(0) 推荐(0) 编辑
HDU 4417 主席树写法
摘要:Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6208 Accepted Submission(s): 2687 Pro 阅读全文
posted @ 2017-03-04 22:21 半根毛线 阅读(271) 评论(0) 推荐(0) 编辑
HDU 2655 主席树
摘要:Kth number Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10240 Accepted Submission(s): 3153 Pr 阅读全文
posted @ 2017-03-04 21:56 半根毛线 阅读(302) 评论(0) 推荐(0) 编辑
Codeforces Round #381 (Div. 2) D dfs序+树状数组
摘要:D. Alyona and a tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Alyona has a tree w 阅读全文
posted @ 2017-02-25 13:50 半根毛线 阅读(249) 评论(0) 推荐(0) 编辑
HDU 4417 离线+树状数组
摘要:Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6174 Accepted Submission(s): 2675 Pro 阅读全文
posted @ 2017-02-23 22:31 半根毛线 阅读(240) 评论(0) 推荐(0) 编辑
树状数组彻底入门
摘要:int lowbit(int t) { return t&(-t); } void add(int x,int y) { for(int i=x;i<=n;i+=lowbit(i)) tree[i]+=y; } int getsum(int x) { int ans=0; for(int i=x;i 阅读全文
posted @ 2016-12-06 22:25 半根毛线 阅读(23985) 评论(11) 推荐(35) 编辑
HDU 4358 莫队算法+dfs序+离散化
摘要:Boring counting Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 98304/98304 K (Java/Others)Total Submission(s): 2808 Accepted Submission(s): 826 阅读全文
posted @ 2016-10-22 20:22 半根毛线 阅读(371) 评论(0) 推荐(0) 编辑
UVA 11995 STL 使用
摘要:There is a bag-like data structure, supporting two operations: Throw an element x into the bag. Take out an element from the bag. Given a sequence of 阅读全文
posted @ 2016-04-20 20:52 半根毛线 阅读(237) 评论(0) 推荐(0) 编辑
2016广东工业大学校赛 D题 GDUT-oj1172
摘要:Problem D: 二叉树的中序遍历 Description 对于学过数据结构的人来说,二叉树和二叉树上的中序遍历都是再简单不过的东西了。这道题就搞搞二叉树好了,当然,不是一般的二叉树:) 我们定义一种a二叉树,它的节点内容可以是任一个数字或者#,#只能作为叶子节点的内容。 如下就是一棵合法定义的 阅读全文
posted @ 2016-04-10 23:49 半根毛线 阅读(465) 评论(0) 推荐(0) 编辑
hdu 1698 线段树 区间更新 区间求和
摘要:Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24474 Accepted Submission(s): 12194 P 阅读全文
posted @ 2015-12-18 00:16 半根毛线 阅读(274) 评论(0) 推荐(0) 编辑
hdu 1166线段树 单点更新 区间求和
摘要:敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64378Accepted Submission(s): 27133Problem Desc... 阅读全文
posted @ 2015-12-17 23:22 半根毛线 阅读(233) 评论(0) 推荐(0) 编辑
HDU 2646 栈的应用 STL
摘要:ExpressionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 202Accepted Submission(s): 61 Problem D... 阅读全文
posted @ 2015-11-26 23:38 半根毛线 阅读(277) 评论(0) 推荐(0) 编辑

 
halfyarn@gmail.com
点击右上角即可分享
微信分享提示