![](https://img-blog.csdnimg.cn/20201014180756913.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
模板_全手打
文章平均质量分 79
Lawrence_Jang
这个作者很懒,什么都没留下…
展开
-
树状数组模板区间更新 区间询问
14、树状数组(1)、单点增减+区间求和思路:C[x]表示该点的元素:sum(x)=C[1]+C[2]+……C[x]int arr[MAXN];inline int sum(int x){int res=0;while(x)res+=arr[x],x-=lowbit(x);return res;}inline void add(int x,int n){while(x<MAXN)a转载 2012-10-09 21:59:37 · 7844 阅读 · 3 评论 -
tarjan 边连通分量+2-sat 模板
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 2000000000#define linf 1000000000000000000LL#defin原创 2012-10-15 16:02:56 · 474 阅读 · 0 评论 -
完整版2-sat模板
rt#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 2000000000#define linf 1000000000000000000LL#d原创 2012-10-15 21:43:05 · 560 阅读 · 0 评论 -
hoj 1917 2-sat 模板题
#include#include#include#include#include#include#include#include#include#include#include#include#include#include#include#define iinf 2000000000#define linf 1000000000000000000LL#defin原创 2012-10-17 09:51:08 · 442 阅读 · 0 评论 -
poj 2761 treap
利用区间的有序性才可以用treap 其实这题 线段树和树状数组时更好的选择 稍后补上#include#include#include#includeusing namespace std;const int inf=~0U>>1;class treap{ struct node { int val,key,size; node原创 2012-11-23 14:30:51 · 1010 阅读 · 0 评论