10 2022 档案
摘要：bool cmp(int x,int y){ return dfn[x]<dfn[y]; } void build(){ sort(h+1,h+1+k,cmp); q[top=1]=1,g.h[1]=0,g.k=0; for(int i=1;i<=k;i++){ if(h[i]==1) contin
阅读全文
摘要：struct TU{ int k,h[N]; TU(){k=0;memset(h,0,sizeof(h));} struct AB{ int a,b,c,n; }d[N*2]; void cun(int x,int y,int z){d[++k]=(AB){x,y,z,h[x]},h[x]=k;}
阅读全文
摘要：struct gao{ int cnt,a[N]; gao(){memset(a,0,sizeof(a));cnt=0;} gao operator + (const gao &b)const{ gao c; int yu=0; c.cnt=max(cnt,b.cnt); for(int i=1;i
阅读全文
摘要：struct AB{ int k,b; }d[N]; void add(int k,int b){d[++cnt]=(AB){k,b};} int cal(int id,int x){return d[id].k*x+d[id].b;} void upd(int p,int l,int r,int
阅读全文
