最近变懒了,好久没写题解了。。
这场codeforces 是在实验室做的,当晚实验室竟然有8个人同时做codeforces,创下了我们学校集训队熬夜做codeforces的记录,12级的一两个同学上升势头很猛,赞一个。
说一下题目吧:
A:水题
B :水题
C : 比水题稍难
D: 阅读理解题吧,读懂了就秒掉了
E题:
写了一个比较挫的英文
problem E: we can also use BIT to solve this problem. first we should read all the
queries and change every query (v,k) into (depth , left , right) :depth is the depth of
the k sons of v,left and right are the indexes of vector W[d](it saves all the nodes with
depth of d),then we can answer all the queries in the same depth together . So we
transform the problem to another simple problem ,how many distinct values in an
interval .it's easy to solve it just use BIT (off line ).