摘要： Tree CuttingTime Limit:1000MSMemory Limit:65536KTotal Submissions:3525Accepted:2083DescriptionAfter Farmer John realized that Bessie had installed a "tree-shaped" network among his N (1 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 vectorQ[10 阅读全文

摘要： Balancing ActTime Limit:1000MSMemory Limit:65536KTotal Submissions:8048Accepted:3322DescriptionConsider a tree T with N (1 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 using namespace std; 9 10 vectorQ[20002];11 int num[20002];12 int dp[20002][2];13 //DP[I][0] 统计子节点的最大个数14 //. 阅读全文