Kona的博客

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1166不解释了，线段树经典例题。#include#include#include#include#includeusing namespace std;const int maxn = 400005;int Size, n, dat[2 * maxn];void in

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1754裸线段树1：结点式存储#include#include#include#include#includeusing namespace std;const int maxn = 200005;int Size, n, m;struct line{ i

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2795线段树单点更新#include#include#include#include#includeusing namespace std;const int maxn = 200005;int Size, n, w, h;int H[maxn];struct line

题目链接：http://poj.org/problem?id=3468题意：给你N个数，然后有M个操作。有两种类型的操作，（1）“Ca b c”，表示将区间[a,b]里的数加上c。（2）“Q a b”，表示查询区间[a,b]的数的和区间维护线段树模板题 #include<iostream>#include<cstdio>#include<cstr...

题目：https://www.luogu.org/problemnew/show/P3369 #include<bits/stdc++.h>//#define DEBUGusing namespace std;const int inf = 2e9 + 50;class node{public: node* ch[2], *fa; ...