线段树
Shili_Xu
闽粤田头一村夫而已。
展开
-
HDU 3333 Turing Tree(线段树)
Turing Tree Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5748 Accepted Submission(s): 2046 Problem Description After inventin原创 2017-09-24 18:27:26 · 337 阅读 · 0 评论 -
Codeforces Round #504(Div.2)Problem D Array Restoration(线段树)
D. Array Restoration time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Initially there was an array aa consisting of nn integers. P...原创 2018-08-18 16:21:21 · 420 阅读 · 0 评论 -
HDU 6315 Naive Operations(线段树)
Naive Operations Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 502768/502768 K (Java/Others) Total Submission(s): 1659 Accepted Submission(s): 709 Problem Description In a galaxy far,...原创 2018-07-26 18:58:39 · 231 阅读 · 0 评论 -
HYSBZ 2243 染色(树链剖分+线段树)
2243: [SDOI2011]染色Time Limit: 20 Sec Memory Limit: 512 MBSubmit: 9954 Solved: 3773[Submit][Status][Discuss]Description给定一棵有n个节点的无根树和m个操作,操作有2类:1、将节点a到节点b路径上所有点都染成颜色c;2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同...原创 2018-05-17 01:19:46 · 324 阅读 · 0 评论 -
POJ 2104 K-th Number(可持久化线段树+二分)
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 63484 Accepted: 22370Case Time Limit: 2000MSDescriptionYou are working for Macrohard company in data structures department. After ...原创 2018-03-05 19:15:47 · 334 阅读 · 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): 7073 Accepted Submission(s): 1651Problem DescriptionBackgroundTo The Moon is a ind...原创 2018-03-05 18:25:52 · 443 阅读 · 0 评论 -
SPOJ QTREE Query on a tree(树链剖分+线段树)
QTREE - Query on a tree#treeYou are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions of the following fo...原创 2017-12-25 19:39:54 · 319 阅读 · 0 评论 -
HYSBZ 1036 树的统计Count(树链剖分+线段树)
1036: [ZJOI2008]树的统计Count Time Limit: 10 Sec Memory Limit: 162 MB Submit: 19818 Solved: 8066 [Submit][Status][Discuss] Description 一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作:原创 2017-12-24 16:30:23 · 227 阅读 · 0 评论 -
牛客练习赛7 C 随机树(DFS序+线段树+快速幂)
时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32768K,其他语言65536K 64bit IO Format: %lld 题目描述 平⽇⾥写hash的时候,总有某些选⼿由于脸⿊⽽导致惨遭卡模数,然后⼀些 恶意卡模数的出题⼈也因此⾝败名裂。为了防⽌被卡,我们⽤⼀种⾼级的随机 ⽅式来代替原来的线性随机⽣成,也就是所谓的随机树! 现在有⼀棵编号为0~原创 2017-12-02 00:41:59 · 340 阅读 · 0 评论 -
HDU 6406 Taotao Picks Apples(线段树)
Taotao Picks Apples Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2124 Accepted Submission(s): 678 Problem Description There is an a...原创 2018-08-21 00:27:49 · 419 阅读 · 0 评论