线段树&树状数组
文章平均质量分 87
丿残念灬
这个作者很懒,什么都没留下…
展开
-
POJ-2777 Count Color(线段树)
Count ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43236 Accepted: 13095DescriptionChosen Problem Solving and Program design as an optional cour原创 2016-08-22 23:49:41 · 314 阅读 · 0 评论 -
HDU-4918 Query on the subtree(树分治+树状数组)
Query on the subtreeTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1193 Accepted Submission(s): 375Problem Descriptionbobo ha原创 2017-07-23 00:58:04 · 407 阅读 · 0 评论 -
Codeforces-834D The Bakery(线段树+dp)
传送门:Codeforces-834D设w(l,r)为[l,r]之间不同数字的个数于是有:f[i][j]=max(f[k][j-1]+w(k+1,i)) k∈[1,i-1]我们可以建立线段树对其进行维护:建立一棵关于f[i][j-1]的线段树,f[i][j-1]=Query(0,i-1)现在要将系列分成j份,w(k+1,i)相当于将[k+1,i]区间内的数对f[i][j]的贡献,将原创 2017-08-01 11:12:59 · 739 阅读 · 0 评论 -
HDU-6078 Wavel Sequence(dp+树状数组)
传送门:HDU-6070题意:有2个序列A和B,要从A,B中选子序列出来组成“小-大-小”这样的序列,且A,B对应的位置要相等,问有多少种选取方法题解:dp+树状数组设f[x][y][k]为当前A数组枚举到第x个,B数组枚举到第y个,起伏状态为k(0/1)时的方案数,考虑到用普通的dp转移会达到O(n^4),可以用二维树状数组进行维护,由于第一维具有递增的特性,因此只要维护第二维的下标原创 2017-08-03 22:30:17 · 921 阅读 · 0 评论 -
HDU-6070 Dirt Ratio(二分+线段树+分数规划)
传送门:HDU-6070上次刚好摔倒在CF Round#427的D题上,这次又来了个类似的题目。。。题意:要求找一段区间使得区间内不同数的个数/区间长度的比值最小题解:二分+线段树设sum为区间内不同数的个数,len为区间长度我们先二分答案得到k,那么我们需要在序列中找一段区间使得它的sum/len转换一下得到sum-len*k,这是我们熟悉的分数规划现在问题就很好原创 2017-08-03 22:45:26 · 1417 阅读 · 0 评论 -
HDU-6102 GCDispower(莫比乌斯函数+树状数组)
传送门:HDU-6102题解:莫比乌斯函数+树状数组+离线操作先对查询按R升序排序,从左到右枚举Ak,再枚举A1~Ak-1中Ak的倍数(因为是1~n的全排列,因此总枚举量为nlogn),得到B数组,将B数组中的数都除以Ak,并按照A中的下标从小到大排序,然后只要求B中所有GCD(Bi,Bj)==1(i求二元组个数可以直接用莫比乌斯函数求得,对于Bi对答案的贡献为cnt[下标大于i且与B原创 2017-08-12 00:45:48 · 444 阅读 · 0 评论 -
HDU-6096 String(字典树+线段树扫描线)
传送门:HDU-6096题解:字典树+线段树扫描线首先用字典树对字符串按前缀的字典序排序,然后翻转字符串再按后缀的字典序排序,如果某些字符串要满足某个前缀,那么这些字符串一定是前缀排序中相邻,如果要满足后缀同理。那么我们就可以得到2个区间[lx,rx],[ly,ry]分别代表满足前缀prf的字符串在[lx,rx]区间,满足后缀suf的字符串在[ly,ry]区间,如果某个字符串同时在这2原创 2017-08-12 00:54:43 · 514 阅读 · 0 评论 -
HDU-6039 Gear Up(线段树+DFS序)
传送门:HDU-6039题意:n个齿轮,有m(m①2齿轮共轴,这时角速度相等②2齿轮共边,这时线速度相等每对齿轮最多只有一种连接方式现在给出2种操作:①修改一个齿轮的半径②给予一个齿轮x角速度y,问所有齿轮中角速度最大值(取自然对数ln(ans))题解:n个齿轮和m条边可以组成一个森林,对于每个节点只要考虑与它连通的节点即可,因此这里只考原创 2017-07-27 23:11:44 · 727 阅读 · 0 评论 -
GYM-101350L All’s Wall That Ends Wall(线段树)
L. All’s Wall That Ends Walltime limit per test3.0 smemory limit per test256 MBinputstandard inputoutputstandard outputIn the magical forest, you come upon N wa原创 2017-08-26 12:59:29 · 800 阅读 · 0 评论 -
COGS-2282 [HZOI 2015]黑树白(树状数组+树链剖分)
2282. [HZOI 2015]黑树白★★ 输入文件:D_Tree.in 输出文件:D_Tree.out 简单对比时间限制:3.5 s 内存限制:512 MB【题目描述】给定一棵树,每个节点有点权,要求维护以下两个操作:1、Q u v a b 本蒟蒻施展大魔法,使得树上所有点权>=a且点权2、M u v 本蒟蒻施展小魔法,将u点的点权改为v原创 2017-08-15 23:49:22 · 353 阅读 · 0 评论 -
COGS-2275 [HEOI 2016] seq(树状数组+线段树)
传送门:COGS-2275题意:给出n个数的序列,并给出m种变化,每次变化会改变一个数的值(临时的),要求找出最长的子序列,这个序列在每次变化中都是单调不减的,输出子序列的长度题解:首先可以得到动态规划公式:f[i]=max(f[j])+1 (Max[j]可以将后面的约束条件转换为二维平面中的点(Max[j],a[j]),问题就转换成求(1,1)到(a[i],Min[i])的矩形内权值原创 2017-08-15 23:56:39 · 288 阅读 · 0 评论 -
COGS-1715 [CQOI2011]动态逆序对(树状数组+线段树)
1715. [CQOI2011]动态逆序对★★★ 输入文件:inverse.in 输出文件:inverse.out 简单对比时间限制:2 s 内存限制:128 MB【题目描述】对于序列A,它的逆序对数定义为满足ij,且Ai>Aj的数对(i,j)的个数。给1到n的一个排列,按照某种顺序依次删除m个元素,你的任务是在每次删除一个元素之前统计整个序列的逆序对数。原创 2017-08-16 00:02:07 · 578 阅读 · 0 评论 -
ZOJ-4009 And Another Data Structure Problem(线段树)
And Another Data Structure ProblemTime Limit: 7 Seconds Memory Limit: 262144 KB Given integers . There are 2 types of operations: 1...原创 2018-03-11 21:46:13 · 466 阅读 · 0 评论 -
HDU-6392 Reverse Game(线段树+并查集)
Reverse GameTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 73 Accepted Submission(s): 34Problem DescriptionOne day, Umaru was enjoyi...原创 2018-08-14 19:52:52 · 499 阅读 · 0 评论 -
HDU-6393 Traffic Network in Numazu(基环树/树剖+树状数组)
Traffic Network in NumazuTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 200 Accepted Submission(s): 70Problem DescriptionChika is e...原创 2018-08-13 23:28:14 · 313 阅读 · 0 评论 -
HDU-6430 TeaTree(线段树合并)
Problem E. TeaTreeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 165 Accepted Submission(s): 57 Problem DescriptionRecently, TeaTr...原创 2018-08-22 20:11:02 · 962 阅读 · 0 评论 -
51Nod-1672 区间交 (贪心+线段树)
1672 区间交 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注小A有一个含有n个非负整数的数列与m个区间,每个区间可以表示为li,ri。它想选择其中k个区间, 使得这些区间的交的那些位置所对应的数的和最大。(是指k个区间共同的交,即每个区间都包含这一段,具体可以参照样例) 在样例中,5个位置对应的值分别为1,2,3,4,...原创 2018-08-25 22:18:50 · 284 阅读 · 0 评论 -
HDU-5759 Gardener Bo(线段树+分类讨论)
Gardener BoTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 182 Accepted Submission(s): 67Problem DescriptionGardener Bo loves原创 2017-07-23 00:35:59 · 630 阅读 · 0 评论 -
HDU-3966 Aragorn's Story(树剖+线段树)
Aragorn's StoryTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9358 Accepted Submission(s): 2447Problem DescriptionOur protagoni原创 2016-09-28 22:50:28 · 314 阅读 · 0 评论 -
FZU-2105 Digits Count(线段树)
Problem 2105 Digits Count Accept: 441 Submit: 2070Time Limit: 10000 mSec Memory Limit : 262144 KB Problem DescriptionGiven N integers A={A[0],A[1],...,A[N-1]}. Here we have some原创 2016-08-24 10:59:18 · 416 阅读 · 0 评论 -
hdu-5592 ZYB's Premutation(线段树)
ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 977 Accepted Submission(s): 496Problem DescriptionZYB has a原创 2016-08-13 10:07:48 · 289 阅读 · 0 评论 -
HDU-3874 Necklace(线段树)
NecklaceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4525 Accepted Submission(s): 1550Problem DescriptionMery has a beautiful原创 2016-08-13 14:59:56 · 421 阅读 · 0 评论 -
CodeForces-483D Interesting Array(线段树)
D. Interesting Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe'll call an array of n non-negative i原创 2016-09-06 21:45:51 · 624 阅读 · 0 评论 -
CodeForces-719E Sasha and Array(线段树+矩阵快速幂)
E. Sasha and Arraytime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSasha has an array of integers a1, a2, .原创 2016-09-28 22:11:12 · 1042 阅读 · 0 评论 -
Min Max Roads(树剖+线段树)
C - Min Max RoadsTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionYou live in a Big country where there are many bi-directional roads原创 2016-09-28 22:57:32 · 413 阅读 · 0 评论 -
POJ-3237 Tree(树链剖分)
TreeTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 8768 Accepted: 2343DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1原创 2016-11-07 22:09:27 · 443 阅读 · 0 评论 -
xtu-1269 Similar Subsequence(dp+树状数组)
Similar SubsequenceAccepted : 17 Submit : 73Time Limit : 10000 MS Memory Limit : 135536 KBSimilar SubsequenceFor given sequence A=(a 1 ,a 2 ,…,a n ) , a原创 2017-05-17 21:38:26 · 468 阅读 · 0 评论 -
HDU-2665 Kth number(主席树)
Kth numberTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10810 Accepted Submission(s): 3317Problem DescriptionGive you a sequen原创 2017-05-19 00:05:23 · 394 阅读 · 0 评论 -
SHUOJ-422 风力观测(线段树)
风力观测发布时间: 2017年7月9日 18:17 最后更新: 2017年7月9日 21:04 时间限制: 1000ms 内存限制: 128M描述小Y正在观测y地区的风力情况,他在一条直线上依此设定了n个观测点,并观测与直线垂直方向的风力值,风力有时是正向的也有时是反向的,规定正向时的风力值为正数,他发现每次风力值的变化都可以表示为观测点上一条线段[L,R]原创 2017-07-10 22:31:16 · 438 阅读 · 0 评论 -
HDU-5957 Query on a graph(线段树+树剖)
Query on a graphTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 325 Accepted Submission(s): 73Problem DescriptionYou are given a原创 2017-07-13 13:24:08 · 891 阅读 · 0 评论 -
Codeforces-831E Cards Sorting(树状数组)
E. Cards Sortingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily has a deck of cards consisting of n原创 2017-07-14 22:33:06 · 1059 阅读 · 0 评论 -
HDU-5975 Aninteresting game(树状数组原理)
Aninteresting gameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 267 Accepted Submission(s): 112Problem DescriptionLet’s play a原创 2017-07-17 10:47:38 · 331 阅读 · 0 评论 -
HDU-4348 To the moon(主席树)
To the moonTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5687 Accepted Submission(s): 1293Problem DescriptionBackgroundTo The原创 2017-07-21 16:23:27 · 325 阅读 · 0 评论 -
HDU-5367 digger(线段树区间合并)
diggerAccepts: 3Submissions: 64Time Limit: 8000/4000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)问题描述地主小花有n座山,这些山在地主家门前排成一条直线。这些山一开始均有相同的高度。 每一天,小花都会要求ZJiaQ原创 2017-07-21 20:34:28 · 411 阅读 · 0 评论 -
POJ-2763 Housewife Wind(树链剖分)
Housewife WindTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 9805 Accepted: 2696DescriptionAfter their royal wedding, Jiajia and Wind hid away in XX Vi原创 2016-10-03 20:10:30 · 495 阅读 · 0 评论 -
Gym-101741C Cover the Paths(LCA+贪心)
C. Cover the Pathstime limit per test1 secondmemory limit per test256 mebibytesinputstandard inputoutputstandard outputYou are given an undirected unweighted tree consisting of n ver...原创 2018-10-15 21:21:10 · 596 阅读 · 0 评论