欢迎投稿
#1
void Build(int rt, int l, int r)
{
tree[rt].l = l;
tree[rt].r = r;
if(l == r)
{
tree[rt].sum = a[l];
return;
}
int mid = (l + r) >> 1;
Build(lson, l, mid);
Build(rson, mid+1, r);
pushup(rt);
}
#2
void jian(int k,int l,int r){
if(l==r)tr[k].sum=a[l];
else{
int mid=(l+r)>>1;
jian(k<<1,l,mid);
jian(k<<1|1,mid+1,r);
geng(k);
}
}
#3
void build(int rt, int l, int r){
t[id].l = l; t[id].r = r; if (l == r) return;
int mid = (l + r) >> 1; build(id << 1, l, mid); build(id << 1 | 1, mid + 1, r); t[id].mn = min(t[id << 1 ].mn, t[id << 1 | 1].mn);
}
#4
namespace Wisadel
{
void Wbuild(int id,int l,int r)
{
t[id].l=l,t[id].r=r;
if(l==r)
{
t[id].dat=a[l];
t[id].sum=a[l];
t[id].miin=a[l];
return;
}
int m=(l+r)>>1;
Wbuild(id*2,l,m);
Wbuild(id*2+1,m+1,r);
t[id].dat=max(t[id*2].dat,t[id*2+1].dat);
t[id].sum=t[id*2].sum+t[id*2+1].sum;
t[id].miin=min(t[id*2].miin,t[id*2+1].miin);
}
}
#5
signed main(){
std::cin>>a>>b;
std::cout<<mo(a+b)<<std::endl;
}
#6
int a,b,c;
int A(){
return a/c;
}
int B(){
return c/b+a;
}
struct d{
int e,f;
};
vector<d>g;
void C(){
g.push_back(d{a,c});
}
int main(){
A();B();C();
}
标签:rt,马蜂,int,sum,猜人,mid,return,id
From: https://www.cnblogs.com/HaneDaCafe/p/18403158