摘要：
There is a rooted tree with n nodes, number from 1-n. Root’s number is 1.Each node has a value ai. Initially all the node’s value is 0. We have q oper 阅读全文
摘要：
http://www.cnblogs.com/kuangbin/p/3147329.html #include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int N=110;const int INF=0 阅读全文