[BZOJ3282/LGOJ3690] Link-Cut Tree 模板题
原题链接LCT模板题没什么解释 先存个档{Beginner_df016}var i,j,k,n,m,top,x,y,id:longint; s,v,fa,q,rev:array[0..300007]of longint; c:array[0..300007,0..2]of longint;procedure swap(var a,b:longint);var t:longint
原创
2017-09-07 15:59:44 ·
261 阅读 ·
0 评论