树状数组
关注
分享
扫一扫
LaLaLa112138
这个作者很懒，什么都没留下…
展开
-
树状数组
就只是单纯的存个板。没有讲解的那种。单点修改区间求和。#include<cstdio> #include<cstring> using namespace std;const int N = 100010;int n,m; int c[N];int lowbit(int x){ return x&(-x); }void adde(int i,int delta){ while(i<=原创 2017-07-13 21:21:53 · 165 阅读 · 0 评论 -
HDU 1294 Minimum Inversion Number 树状数组
Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20752 Accepted Submission(s): 12446Problem DescriptionThe inversion原创 2017-07-29 08:56:52 · 294 阅读 · 0 评论