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

随笔分类 -  数据结构 树状数组

HDU 3966 树链剖分+树状数组 模板
摘要:Aragorn's Story Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13587 Accepted Submission(s): 36 阅读全文
posted @ 2017-10-10 21:26 半根毛线 阅读(260) 评论(0) 推荐(0) 编辑
Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) A 水 B stl C stl D 暴力 E 树状数组
摘要:A. Unimodal Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Unimodal Array time 阅读全文
posted @ 2017-07-14 22:53 半根毛线 阅读(369) 评论(0) 推荐(0) 编辑
2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016) F dfs序+树状数组
摘要:Performance ReviewEmployee performance reviews are a necessary evil in any company. In a performance review, employees give written feedback about eac 阅读全文
posted @ 2017-04-23 20:41 半根毛线 阅读(666) 评论(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) 编辑
2016 ACM/ICPC Asia Regional Dalian Online 1002/HDU 5869
摘要:Different GCD Subarray Query Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 681 Accepted Submiss 阅读全文
posted @ 2016-09-13 00:00 半根毛线 阅读(412) 评论(0) 推荐(0) 编辑
Codeforces Round #365 (Div. 2) D 树状数组+离线处理
摘要:D. Mishka and Interesting sum time limit per test 3.5 seconds memory limit per test 256 megabytes input standard input output standard output D. Mishk 阅读全文
posted @ 2016-08-05 08:03 半根毛线 阅读(583) 评论(1) 推荐(0) 编辑
poj 2299 树状数组求逆序对数+离散化
摘要:Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 54883 Accepted: 20184 Description In this problem, you have to analyze a pa 阅读全文
posted @ 2016-08-02 20:37 半根毛线 阅读(360) 评论(0) 推荐(0) 编辑
HDU 5775 树状数组
摘要:Bubble Sort Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 853 Accepted Submission(s): 504 Probl 阅读全文
posted @ 2016-08-02 19:28 半根毛线 阅读(277) 评论(0) 推荐(0) 编辑
HDU 1556 线段树/树状数组/区间更新姿势 三种方法处理
摘要:Color the ball Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15145 Accepted Submission(s): 7540 阅读全文
posted @ 2016-04-13 21:34 半根毛线 阅读(254) 评论(0) 推荐(0) 编辑
HDU 5249 离线树状数组求第k大+离散化
摘要:KPI Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1160 Accepted Submission(s): 488 Problem Desc 阅读全文
posted @ 2016-03-30 21:17 半根毛线 阅读(307) 评论(0) 推荐(0) 编辑

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