fyfcauc的专栏

// 3756K 719MS G++ #include #include #include using namespace std; struct TreeNode { // 0: no color, >= 1, whole cover by one color, -1: one color // , but not whole covered, -2: >

#include #include #define MAX 65536 struct TreeNode { int left; int right; int color; //0: all no choosed 1: all choosed, -1: combined int leftFlag; //0: [ , 1: ( int rightFlag; //0: [ , 1:

From: http://www.notonlysuccess.com/index.php/segment-tree-complete/ 很早前写的那篇线段树专辑至今一直是本博客阅读点击量最大的一片文章,当时觉得挺自豪的,还去pku打广告,但是现在我自己都不太好意思去看那篇文章了,觉得当时的代码风格实在是太丑了,很多线段树的初学者可能就是看着这篇文章来练习的,如果不小心被我培养出了这么糟糕的

// 2404K 3688MS G++ #include #include const int MAX = 50010; struct TreeNode { int left; int right; int Max; int Min; }; typedef struct TreeNode TreeNode; TreeNode tree[MAX<<

// 6884K 2032MS G++ #include "cstdio" #include "cstring" #include "iostream" using namespace std; #define MAX 100010 struct TreeNode { long left; long right; long long sum; long

From: http://www.cnblogs.com/TenosDoIt/p/3453089.html#b -------------------------- 一 概述 线段树，类似区间树，是一个完全二叉树，它在各个节点保存一条线段（数组中的一段子数组），主要用于高效解决连续区间的动态查询问题，由于二叉结构的特性，它基本能保持每个操作的复杂度为O(logn)。 线段树的每个节点表

// 24976K 6125MS C++ #include #include using namespace std; #define K_MAX 1000010 #define INF 99999999 struct TreeNode { int left; int right; int max; int min; }; typedef str

#include #include #include const int MAX = 10010; struct TreeNode { int left; int right; // double X; // double Y; double length; // double Height; int angel; int lazyRotation; }; typede

#include #include #define MAX 100010 int flowers[MAX]; using namespace std; int flowerNum; inline int max(int a, int b) { return a >= b ? a: b; } inline int min(int a, int b) { return

// 14460K 3766MS G++ #include #include #define MAX 200100 struct TreeNode { int val; int l; int r; int insertPosNum; }; typedef struct TreeNode TreeNode; TreeNode tree[MAX*4];

// 20884K 297MS G++ #include #include #include int posterNum; int ep[20010]; unsigned short dis[10000010]; int epNum; int cmp(const void * p1, const void * p2) { return (*((int*)p1)) - (

// 668K 422MS G++ #include #include const int MAX = 32767; const int LEVEL_MAX = 15100; int tree[MAX<<1]; int levelNum[LEVEL_MAX]; int starNum; void update(int curId, int x, int begin, int en

// 26584K 1407MS G++ #include #include #include using namespace std; #define MAX 500050 struct ChildeTreeNode { int childId; int childNum; int left; int right; }; typedef str

// 2240K 1297MS C++ #include #include #include #include #include using namespace std; const int MAX = 8010 * 2; set lineVisibleInfo[8000]; struct TreeNode { int left; int right; int lineId