树状数组
zyhsdl
这个作者很懒,什么都没留下…
展开
-
树状数组的模版
#include#include#includeusing namespace std;int a[1000];int sum[1000];int n;int c(int x){ return x&(x^(x-1));}void change(int x,int add){ while(x {sum[x]=sum[x]+add;原创 2015-12-03 21:26:47 · 250 阅读 · 0 评论 -
数星星
#include#include#include#include#include#include#include#includeusing namespace std;const int MAXN=200005;struct star{int x,y; int left,right,up,down; int xsmall,xlarge,ysmal原创 2015-12-03 21:32:32 · 377 阅读 · 0 评论 -
树状数组求逆序对666
#include #include #include using namespace std; const int N=500010; #define LL __int64 int c[N],b[N],n; struct node{ int val,pos; bool operator return val原创 2015-12-03 21:27:43 · 318 阅读 · 0 评论 -
奶牛的狂欢节
注意如何用较快方法处理距离#include#include#includeusing namespace std;int sum[1000][1000];int n,t;int c(int x){ return x&(x^(x-1));}void change(int x,int y,int add){int ty=y; while原创 2015-12-03 21:30:50 · 419 阅读 · 0 评论 -
矩阵的操作
#include#include#includeusing namespace std;int sum[1000][1000];int n,t;int c(int x){ return x&(x^(x-1));}void change(int x,int y,int add){int ty=y; while(x { y=ty;原创 2015-12-03 21:28:43 · 292 阅读 · 0 评论