![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
线段树
文章平均质量分 86
_TianZhirui
我比昨天更强???
展开
-
poj1151(离线化+扫描线+线段树)
Atlantis Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24048 Accepted: 8944 Description There are several ancient Greek texts that contain descriptions o转载 2018-01-13 23:25:46 · 281 阅读 · 0 评论 -
spoj8002 线段树区间更新,区间求和
HORRIBLE - Horrible Queries #tree #binary-search World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you原创 2018-01-14 01:13:43 · 154 阅读 · 0 评论 -
SPOJ 8002 Horrible Queries(线段树)区间更新,区间和
HORRIBLE - Horrible Queries #tree #binary-search World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the legendary Bad Horse has retired, now you原创 2018-01-13 19:50:47 · 253 阅读 · 0 评论 -
线段树(segment tree)点更新,区间最小值
void build(int node, int start, int end, int tree[], int a[]) { if (start == end) tree[node] = a[start]; else { int mid = (start + end) / 2; build(2 * node, start,原创 2018-01-05 21:53:28 · 335 阅读 · 0 评论 -
区间最大值最小值区间和查询
动态区间最大值最小值区间和查询,支持区间设置,线段树 对区间 [0,N-1] 支持两种操作: 1. update(L, R, v) 将区间[L,R] 的所有值设置为 v; 2. query(L, R) 查询区间 [L, R] 的最大值、最小值、区间和; 利用线段树解决该问题,更新时,对某区间的设置操作不需要分解到其每一个子区间(否则可能要更新每一个叶子节点),只需在原创 2018-01-25 13:06:28 · 1490 阅读 · 0 评论 -
线段树的点更新+求区间的最大两个数之和
KGSS - Maximum Sum #tree You are given a sequence A[1], A[2], ..., A[N] ( 0 ≤ A[i] ≤ 10^8 , 2 ≤ N ≤ 10^5 ). There are two types of operations and they are defined as follows: Update: T原创 2018-01-25 14:31:20 · 203 阅读 · 0 评论 -
01待解决的重要问题:
设计二分,线段树,树状数组: code forces470C. Producing Snow http://codeforces.com/contest/948/problem/C 解法参考:二分:http://blog.csdn.net/haut_ykc/article/details/79514717 树状数组:https://www.cnblogs.com/HazelNut/p原创 2018-03-11 17:07:23 · 143 阅读 · 0 评论 -
HDU 4630 gcd(线段树离线处理)
No Pain No Game Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1801 Accepted Submission(s): 770 Problem Description Life is a转载 2018-03-31 23:30:36 · 166 阅读 · 0 评论