ASTAR2016 ROUND2A 1003 Snacks

http://bestcoder.hdu.edu.cn/contests/contest_showproblem.php?cid=701&pid=1003
http://acm.hdu.edu.cn/showproblem.php?pid=5692

Problem Description

百度科技园内有n个零食机，零食机之间通过n−1条路相互连通。每个零食机都有一个值v，表示为小度熊提供零食的价值。

由于零食被频繁的消耗和补充，零食机的价值v会时常发生变化。小度熊只能从编号为0的零食机出发，并且每个零食机至多经过一次。另外，小度熊会对某个零食机的零食有所偏爱，要求路线上必须有那个零食机。

为小度熊规划一个路线，使得路线上的价值总和最大。

Input

输入数据第一行是一个整数T(T≤10)，表示有T组测试数据。

对于每组数据，包含两个整数n,m(1≤n,m≤100000)，表示有n个零食机，m次操作。

接下来n−1行，每行两个整数x和y(0≤x,y<n)，表示编号为x的零食机与编号为y的零食机相连。

接下来一行由n个数组成，表示从编号为0到编号n−1的零食机的初始价值v(∣v∣<100000)。

接下来m行，有两种操作：0 x y，表示编号为x的零食机的价值变为y；1 x，表示询问从编号为0的零食机出发，必须经过编号为x零食机的路线中，价值总和的最大值。

本题可能栈溢出，辛苦同学们提交语言选择c++，并在代码的第一行加上：

#pragma comment(linker, "/STACK:1024000000,1024000000")

Output

对于每组数据，首先输出一行”Case #?:”，在问号处应填入当前数据的组数，组数从1开始计算。

对于每次询问，输出从编号为0的零食机出发，必须经过编号为x零食机的路线中，价值总和的最大值。

Sample Input

1
6 5
0 1
1 2
0 3
3 4
5 3
7 -5 100 20 -5 -7
1 1
1 3
0 2 -1
1 1
1 5

Sample Output

Case #1:
102
27
2
20

Solution

将树按照 dfs 序展开，那么询问 1 x 就是一段区间内的点，离 0 的距离的最大值。可以考虑区间最值查询的相关数据结构。

对于更改点权的操作，将其变成增加点权的操作，那么也就是带区间更新的区间最值查询，到此可以用线段树解决该题。

另外，可以一开始建立点权全部为 0 的树，然后更新添加点权，精简代码。

Code

1. #pragma comment(linker, "/STACK:1024000000,1024000000") 

   ---

2. #include <stdio.h> 

   ---

3. #include <string.h> 

   ---

4. #include <stdlib.h> 

   ---

5.  

   ---

6. #include <algorithm> 

   ---

7. #include <vector> 

   ---

8.  

   ---

9. const int N = 100000 + 10; 

   ---

10.  

    ---

11. std::vector<std::vector<int> > g; 

    ---

12.  

    ---

13. int dfsl[N]; 

    ---

14. int dfsr[N]; 

    ---

15.  

    ---

16. void dfs(int u, int f, int& timestamp) 

    ---

17. { 

    ---

18. dfsl[u] = ++timestamp; 

    ---

19. for (int i = 0; i < (int) g[u].size(); ++i) { 

    ---

20. int v = g[u][i]; 

    ---

21. if (v == f) { 

    ---

22. continue; 

    ---

23. } 

    ---

24. dfs(v, u, timestamp); 

    ---

25. } 

    ---

26. dfsr[u] = timestamp; 

    ---

27. } 

    ---

28.  

    ---

29. struct segment_tree_t 

    ---

30. { 

    ---

31. #define ID ((l + r) | (l != r)) 

    ---

32. #define IDL ((l + m) | (l != m)) 

    ---

33. #define IDR ((m+1 + r) | (m+1 != r)) 

    ---

34. #define LSON l, m 

    ---

35. #define RSON m+1, r 

    ---

36.  

    ---

37. struct tree_node 

    ---

38. { 

    ---

39. long long maxlen; 

    ---

40. long long flag; 

    ---

41.  

    ---

42. void add(long long x) 

    ---

43. { 

    ---

44. maxlen += x; 

    ---

45. flag += x; 

    ---

46. } 

    ---

47. } tree[N << 1]; 

    ---

48.  

    ---

49. void build(int l, int r) 

    ---

50. { 

    ---

51. tree[ID].maxlen = tree[ID].flag = 0; 

    ---

52. if (l == r) { 

    ---

53. return; 

    ---

54. } 

    ---

55. int m = (l + r) >> 1; 

    ---

56. build(LSON); build(RSON); 

    ---

57. } 

    ---

58.  

    ---

59. void pushdown(int l, int r) 

    ---

60. { 

    ---

61. int m = (l + r) >> 1; 

    ---

62. long long& flag = tree[ID].flag; 

    ---

63. if (flag != 0) { 

    ---

64. tree[IDL].add(flag); 

    ---

65. tree[IDR].add(flag); 

    ---

66. flag = 0; 

    ---

67. } 

    ---

68. } 

    ---

69.  

    ---

70. void pushup(int l, int r) 

    ---

71. { 

    ---

72. int m = (l + r) >> 1; 

    ---

73. tree[ID].maxlen = std::max(tree[IDL].maxlen, tree[IDR].maxlen); 

    ---

74. } 

    ---

75.  

    ---

76. void update(int l, int r, int x, int y, int add) 

    ---

77. { 

    ---

78. if (l == x && r == y) { 

    ---

79. tree[ID].add(add); 

    ---

80. return; 

    ---

81. } 

    ---

82.  

    ---

83. int m = (l + r) >> 1; 

    ---

84. pushdown(l, r); 

    ---

85. if (y <= m) { 

    ---

86. update(LSON, x, y, add); 

    ---

87. } 

    ---

88. else if (x > m) { 

    ---

89. update(RSON, x, y, add); 

    ---

90. } 

    ---

91. else { 

    ---

92. update(LSON, x, m, add); 

    ---

93. update(RSON, m+1, y, add); 

    ---

94. } 

    ---

95. pushup(l, r); 

    ---

96. } 

    ---

97.  

    ---

98. long long query(int l, int r, int x, int y) 

    ---

99. { 

    ---

100. if (l == x && r == y) { 

     ---

101. return tree[ID].maxlen; 

     ---

102. } 

     ---

103.  

     ---

104. int m = (l + r) >> 1; 

     ---

105. pushdown(l, r); 

     ---

106. if (y <= m) { 

     ---

107. return query(LSON, x, y); 

     ---

108. } 

     ---

109. else if (x > m) { 

     ---

110. return query(RSON, x, y); 

     ---

111. } 

     ---

112. else { 

     ---

113. return std::max(query(LSON, x, m), query(RSON, m+1, y)); 

     ---

114. } 

     ---

115. } 

     ---

116. } st; 

     ---

117.  

     ---

118. int a[N]; 

     ---

119.  

     ---

120. void task(int casi) 

     ---

121. { 

     ---

122. printf("Case #%d:\n", casi); 

     ---

123.  

     ---

124. int n, m; 

     ---

125. scanf("%d %d", &n, &m); 

     ---

126. g.clear(); 

     ---

127. g.resize(n); 

     ---

128. for (int i = 1; i < n; ++i) { 

     ---

129. int u, v; 

     ---

130. scanf("%d %d", &u, &v); 

     ---

131. g[u].push_back(v); 

     ---

132. g[v].push_back(u); 

     ---

133. } 

     ---

134.  

     ---

135. int timestamp = 0; 

     ---

136. dfs(0, -1, timestamp); 

     ---

137.  

     ---

138. st.build(1, n); 

     ---

139. for (int i = 0; i < n; ++i) { 

     ---

140. scanf("%d", a+i); 

     ---

141. st.update(1, n, dfsl[i], dfsr[i], a[i]); 

     ---

142. } 

     ---

143. for (int mi = 1; mi <= m; ++mi) { 

     ---

144. int cmd; 

     ---

145. int x, y; 

     ---

146. scanf("%d", &cmd); 

     ---

147. if (cmd == 0) { 

     ---

148. scanf("%d %d", &x, &y); 

     ---

149. y -= a[x]; 

     ---

150. st.update(1, n, dfsl[x], dfsr[x], y); 

     ---

151. a[x] += y; 

     ---

152. } 

     ---

153. else { 

     ---

154. scanf("%d", &x); 

     ---

155. printf("%I64d\n", st.query(1, n, dfsl[x], dfsr[x])); 

     ---

156. } 

     ---

157. } 

     ---

158. } 

     ---

159.  

     ---

160. int main() 

     ---

161. { 

     ---

162. int casc; 

     ---

163. scanf("%d", &casc); 

     ---

164. for (int casi = 1; casi <= casc; ++casi) { 

     ---

165. task(casi); 

     ---

166. } 

     ---

167. return 0; 

     ---

168. } 

     ---

转载于:https://www.cnblogs.com/gu-castle/p/5516366.html