Roly

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1166 这题可以用树状数组来做,也可以用线段树来做,不过线段树虽然功能强大,但是代码量大. 树状数组： #include #include #include #define MAX 50005 using namespace std; char str[4][6] = {"Query","Ad

#include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; const int maxn = 500005; int tree[maxn << 2]; struct child{ char name[20]; int card; }cc[maxn]; vo

#include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; const int maxn = 200004; int pos[maxn]; int val[maxn]; int tree[maxn<<2]; void PushUp(int rt){ tree[rt]

#include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; typedef long long ll; const int maxn = 100005; ll tree[maxn<<2]; ll flag[maxn<<2]; void PushUp(int rt) {

#include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; const int maxn = 200005; int tree[maxn<<2]; char str[10]; void PushUp(int rt){ tree[rt] = max(tree[rt<

#include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; const int maxn = 200005; int tree[maxn<<2]; int h,w,n; void PushUp(int rt){ tree[rt] = max(tree[rt<<1]

题意： #include #include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; const int maxn = 5005; int a[maxn]; int tree[maxn<<2]; void PushUp(int rt){ tree[rt]

#include #include #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 using namespace std; const int maxn = 1100005; int tree[maxn<<2]; int flag[maxn<<2]; void PushUp(int rt){ tree[rt] = tree[

因为规模比较大 离散化+线段树