做树链剖分最头疼的就是LCA的特殊性,有必要自己证明一下,否则用着不踏实,以求x到y的sum为例,z=lca(x,y)procedure solvesum; begin ans:=0; while ch' ' do read(ch); readln(x,y); while top... Read More
1674: [Usaco2005]Part AcquisitionTime Limit:5 SecMemory Limit:64 MBSubmit:259Solved:114[Submit][Status]DescriptionThe cows have been sent on a mission... Read More