树状数组
Change_ZHONG
成在坚持
展开
-
tjut 2852
#include #include #include using namespace std; #define N 100010 #define Lowbit(x) ((x)&(-x)) int C[N]; bool vis[N]; void add(int x,int num) { while(x < N) {原创 2016-08-10 16:13:10 · 209 阅读 · 0 评论 -
tjut 4046
#include #include using namespace std; int n, m; int c[60000]; char str[60000]; int lowbit ( int x ) { return x & ( -x ); } void update ( int x, int v )原创 2016-09-01 22:45:35 · 163 阅读 · 0 评论 -
tjut 3030
#include #include #include #include #include using namespace std; #define LL __int64 #define lowbit(x) (x&(-x)) const LL mod=1e9+7; const LL maxn=500050; LL a[maxn],b[maxn],c[原创 2016-08-12 10:18:53 · 193 阅读 · 0 评论 -
poj 3928
#include #include #include #include using namespace std; const int maxn=100000; int n,t; __int64 c[maxn],lmin,lmax,rmin,rmax,ans; struct node { int x,id; }p[maxn+2]; int cm原创 2016-09-03 23:07:45 · 217 阅读 · 0 评论 -
poj 1990
#include #include #include #define MAX(a,b) (a>b?a:b) #define ABS(a) ((a)>0?(a):-1*(a)) #define TK(a) (a&(a^(a-1))) #define N 20005 using namespace std; struct Node { long long v,x; bool原创 2016-09-05 20:18:30 · 145 阅读 · 0 评论 -
poj 3067
#include #include #include #include #define LL long long using namespace std; const int M=1003; LL C[M]; int n,m,k; struct Node { int x,y; }edge[1003*1002]; bool cmp(No原创 2016-09-06 22:01:18 · 165 阅读 · 0 评论