搜索资源列表
SegmentTreestartear
- 线段树C++实现源码，包括离散化算法+扫描线法+染色问题-Segment tree implementation C++ source code, including the discrete algorithm+ scan-line method+ staining problems
segmentTree
- 线段树算法的详细解析.内容十分详尽.可以作为acm初学者的入门教程-Segment tree algorithm is a detailed analysis. Is thorough and comprehensive
struct
- 高级数据结构 线段树 树状数组 跳跃表 -Advanced data structure array segment tree tree jump table
xianduanshu
- 陈宏（线段树） 国家队论文，很好的一个文章-Chen Hong (line trees) team paper, a very good article
poj3468
- acm poj3468 线段树 解题报告-acm poj3468 problem-solving report segment tree
1823
- poj 1823源码 关于二维线段树，比较基础的实现。-poj 1823
1195
- 1195 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-1195 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
2155
- 2155 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-2155 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
3277
- 3277 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-3277 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
poj2352
- poj2352 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-poj2352 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
poj-3468
- poj3468 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-poj3468 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
2777
- poj2777 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-poj2777 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
2528
- poj2528 线段树，实现的比较简单，利于刚刚开始学习的人 。-poj2528 segment tree, simple implementation, which will help people who have just started learning.
basic-algo.pdf
- ACM常用算法与数据结构，如平衡树，线段树，各种网络流算法。-ACM commonly used algorithms and data structures, such as the balanced tree, segment tree, a variety of network flow algorithms.
seg
- 线段树经典应用，求合并矩形的周长。IOI经典题目Picture。-Classic application of the segment tree, find the perimeter of the rectangle consolidation.
Basics-segment-tree
- 线段树的定义，功能，实现和用途，能帮助学习线段树-Segment tree definition, function, implementation and use, can help learning segment tree
Intersection
- 对于平面内给定的所有的水平或竖直线段，求其交点总数。运用线段树使程序在交点较少时能快于暴力算法-For a given plane, horizontal or vertical line of all, find the intersection number。
data-structure
- 并查集，并查集扩展，堆，矩形切割，线段树，线段树扩展，线段树应用，字段和，子阵和。-And check collection, and investigations set extensions, stack, rectangular cut, segment tree, expand the tree line, tree line applications, fields, and, sub-array and.
xianduanshu
- 本程序用C编写，陈述了“线段树”的具体操作方法-This program written by C, the statement of the " tree line" of the specific methods of operation
SBT
- 利用线段树套平衡树查询区间第K大数，并满足修改操作，复杂度log^2(n)-Balanced tree using segment tree sets large numbers query interval s K, and operations to meet the changes, the complexity of log ^ 2 (n)