摘要:
如果$L$小一点的话方程就很显然了,是$f[i]=min_{j=S}^{j include include include using namespace std; const int N=20005; int f[N],dis[N],L,S,T,M,a[N],ans,sum; bool stone 阅读全文
摘要:
并查集按秩合并的裸题。。。 cpp include include include using namespace std; const int N=500005; int fa[N],lastans,val[N],n,Q,u,v,opt,cnt,dep[N]; bool tong[N]; int 阅读全文