随笔分类 -  数据结构 树状数组

摘要:#include #define LL long long using namespace std; const LL mod=1e9+7; const int maxn=1e6+10; #define lowbit(x) (x&(-x)) struct BIT { LL**a;int n,m; BIT(){a=0;n=m=-1;} BIT(int n,int m):n... 阅读全文
posted @ 2018-11-01 21:05 BIack_Cat 阅读(153) 评论(0) 推荐(0)
摘要:#include using namespace std; #define LL long long const int maxn=2e5+10; struct BIT //binary index tree { int t[maxn],n; int a[maxn]; #define lowbit(x) (x&(-x)) void init(int n_) ... 阅读全文
posted @ 2018-10-11 04:26 BIack_Cat 阅读(395) 评论(0) 推荐(0)