dish dp plus

#include #include #include #include using namespace STD;typedef vectorint>Vectypedef vectorMatConst intm=10007;typedef Long LongLl;mat Mul (Mat a,mat b) {Mat C (A.size (), VEC (b[0].size ())); for(inti =0; i for(intK =0; K for(intj =0; J 0].size (); j + +) {C[i][j]+=a[i][k]*b[k][j]; C[I][J]%= M; } } }returnC;} Mat Fun (Mat a,ll N) {Mat B (A.size (), VEC (A.size ())); for(inti =0; i 1; } while(N >0){if(n1) B=mul (b,a); A = Mul (a,a); N >>=1; }returnB;}intMain () {i

Question: Extra Binary Tree[Problem description]Set the ordinal traversal of a tree with N nodes to (l, 2, 3 ,..., N), where the number is 1, 2, 3 ,..., N is the node number. Each node has a score (all positive integers). Note that the score of node I is Di. The tree and each of its Subtrees have a plus score, the method for calculating the extra points of any subtree (also including the tree itself) is as follows:Bonus points for the left subtree