搜索资源列表
poj2352
- poj2352 二维线段树，实现的比较简单，利于刚刚开始学习的人 。-poj2352 two-dimensional segment tree, simple implementation, which will help people who have just started learning.
SegmentTree
- 一个效率可以的线段树代码 可以直接用来求解矩形面积并 另外可以修改实现更多功能.-The efficiency of the line segment can be a tree code can be directly used to solve the rectangular area and the other can be modified to achieve more.
ST
- RMQ问题。。 不用线段树实现。 ST算法运用的是动态规划和二进制优化的思想。使得编程复杂度降低了很多很多。-RMQ problem. . Needless to achieve segment tree. ST algorithm used is a dynamic planning and optimization of binary thinking. Makes programming reduces the complexity of many.
tree
- 线段树的基本实现～动态实现。功能并不强大-Segment tree to achieve the realization of ~ dynamic. Function is not strong
kd-trees
- 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构：线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
vijos1083
- 线段树 求最大字段和以vijos1083为例-Segment tree for the largest fields and
ACM_ICPC_SEGMENT_TREE_BY__ACMaryland
- ppt about segment tree , which is a data structrue that usually used in ACM_ICPC
ctree
- 本程序运用线段树+离散化+扫描线的方法来求解矩形周长问题。是运用线段数解题的经典应用之一。-This procedure using discrete segment of the tree++ scan line approach to solving the problem of rectangular perimeter. Segment is to use a number of problem-solving one of the classic applications.
segment_tree
- 线段树的基本数据结构，线段树扩展，线段树应用。-The basic segment tree data structure, segment tree expansion, segment tree application.
SegmetTree
- 线段树的经典之作！程序员进阶必读!互相帮助！-segment tree!
Basics-segment-tree
- 线段树的定义，功能，实现和用途，能帮助学习线段树-Segment tree definition, function, implementation and use, can help learning segment tree
segment-tree
- 线段树的第一类型，介绍了线段树中的单点更新问题-The first type of tree line, introduced a single point in the tree line update problem
Segment-tree
- 线段树作为一种常用的数据结构，有常用性，基础性和易用性等诸多特点。在这里讲一讲关于线段树。-Segment tree as a common data structure, a common, basic and ease of use, and many other features. Here to talk about on the segment tree.
Line-tree-and-its-application
- 描述了关于线段树的一些原理及基本操作，后面引用两个例题详细介绍了离散化，扫描线，以及二维线段树-Describes the segment tree some of the principles and basic operation, followed by reference to the two examples described in detail the discretization, scan lines, as well as two-dimensional segment tr
segment-tree
- 线段树例题,POJ上面的一些经典例题，这几天的心血。-Some of the classic examples of the segment tree example, POJ above, a few days of hard work.
Segment-Tree.cpp
- segmen tree estructura de datos
segment-tree
- 线段树的基本操作，个类oj题目，有源代码，可以相互学习-The basic operation of the tree line, a class oj topic, source code, you can learn from each other
tree
- 数据结构线段树的代码，希望能帮助到许多人-The code segment tree data structure, hoping to help many people
segment-tree
- 在实际应用中，常遇到与区间有关的操作，比如统计若干矩形并集的面积，记录一个区间的最大最小值及总量，并在区间的插入、删除和修改中维护这些数据。线段树的定义是利用树形二分结构所建立的一种数据结构，能够高效的完成这些操作。-In practical applications, often encountered in the interval-related operations, such as statistics and set a number of rectangular area, rec
sklearn-tree-BN-knn
- 分类器的性能比较与调优: 使用scikit-learn 包中的tree，贝叶斯，knn，对数据进行模型训练，尽量了解其原理及运用。 使用不同分析三种分类器在实验中的性能比较，分析它们的特点。 本实验采用的数据集为house与segment。(Performance comparison and optimization of classifiers: We use tree, Bayesian and KNN in scikit-learnpackage to train the dat