02 2020 档案
线段树的基本运算
摘要：#include<cstdio>#include<cstring>const int maxn=100010;#define lowbit(i) ((i)&(i))int c[maxn]; void update(int x,int v) { for(int i=x;i<maxn;i+=lowbit
二叉树的基本运算
摘要：#include<cstdio>using namespace std; struct node { typename data; //数据域 node* lchild; node* rchild; }; node* root = NULL; //新建节点 node*newNode(int v) {
