CODEFORCES 484E Sign on Fence

链接

http://codeforces.com/contest/484/problem/E

题意

给出 n 个宽度为 1 ，高度为 h[i] 的矩形，从 1 到 n 连续挨着排。有 m 次询问，每次询问一段区间 [l, r] 中组成宽度为 w 的矩形的最高高度是多少？(n, m ≤ 1e5, h[i] ≤ 1e9)

思路

自己没想到。听子卿讲题解。

二分答案

二分答案 h，判定 [l, r] 内不低于 h 的矩形是否有连续 w 个。

对于固定 h 的判定问题，我们只要建立一颗线段树，区间存内部大于等于 h 的最长区间长度，靠左靠右的最长区间长度还有本区间长度，进行区间合并。查询 [l, r] 最长连续长度，如果大于等于 w 那么判断就通过。

可持久化

有了上述分析，这个问题要解决的话，只要把对应每个高度的线段树都建立出来就可以了。但是一颗一颗建立显然是不允许的。

注意到线段树之间有共用关系，比如数据是：1 2 2 3。如果对应高度 3 建立了线段树，那么高度为 2 对应的线段树可以看做是高度 3 的线段树进行单点更新（两次）的结果。

如此一来，我们可以将线段树可持久化，解决线段树的建立问题。

复杂度容易知道是：，可以通过该题。

错误

我昨晚写这个题的时候犯了个错误，导致一直没过。

错误主要原因是建树出错，从前建树为了节省时间和内存，函数式的起始树我不会完整的建立，而是用一个点代替，所有要访问这个起始树的都访问到这一个节点。一般这个节点的标号是 0，左右儿子的标号也是 0。起始树当然标记成 root[0] = 0。

但是没有深刻的认识到这个技巧只能用于空树的所有节点的值都相同的状况。对于这个题目，因为我对每个点存了本区间长度，所以是不能这样用的。

代码

1. // c head files 

   ---

2. #include <stdio.h> 

   ---

3. #include <assert.h> 

   ---

4. // c++ head files 

   ---

5. #include <algorithm> 

   ---

6. using std::max; 

   ---

7. using std::sort; 

   ---

8. using std::unique; 

   ---

9. #include <iostream> 

   ---

10. using std::cout; 

    ---

11. using std::endl; 

    ---

12.  

    ---

13. const int MAXN = 100000 + 5; 

    ---

14. const int LOG = 20; 

    ---

15. const int MAXT = LOG * MAXN; 

    ---

16.  

    ---

17. namespace FST 

    ---

18. { 

    ---

19. struct TNode 

    ---

20. { 

    ---

21. int len; 

    ---

22. int lenL; 

    ---

23. int lenR; 

    ---

24. int lenMax; 

    ---

25.  

    ---

26. int lson; 

    ---

27. int rson; 

    ---

28. } tree[MAXT]; 

    ---

29.  

    ---

30. int nodeCnt = 0; 

    ---

31.  

    ---

32. typedef TNode& ref; 

    ---

33. typedef const ref cref; 

    ---

34.  

    ---

35. void push(cref l, cref r, ref now) 

    ---

36. { 

    ---

37. now.len = l.len + r.len; 

    ---

38. now.lenMax = max(max(l.lenMax, r.lenMax), l.lenR + r.lenL); 

    ---

39. now.lenL = l.lenL + (l.lenL == l.len ? r.lenL : 0); 

    ---

40. now.lenR = r.lenR + (r.lenR == r.len ? l.lenR : 0); 

    ---

41. } 

    ---

42.  

    ---

43. void push(ref now) 

    ---

44. { 

    ---

45. int l = now.lson; 

    ---

46. int r = now.rson; 

    ---

47. push(tree[l], tree[r], now); 

    ---

48. } 

    ---

49.  

    ---

50. void init(int& now, int l, int r) 

    ---

51. { 

    ---

52. now = nodeCnt++; 

    ---

53. if (l == r) { 

    ---

54. tree[now].len = 1; 

    ---

55. tree[now].lenL = 0; 

    ---

56. tree[now].lenR = 0; 

    ---

57. tree[now].lenMax = 0; 

    ---

58. return; 

    ---

59. } 

    ---

60. int mid = (l + r) >> 1; 

    ---

61. init(tree[now].lson, l, mid); 

    ---

62. init(tree[now].rson, mid + 1, r); 

    ---

63. push(tree[now]); 

    ---

64. } 

    ---

65.  

    ---

66. void init(int n, int& root0) 

    ---

67. { 

    ---

68. nodeCnt = 0; 

    ---

69. init(root0, 1, n); 

    ---

70. } 

    ---

71.  

    ---

72. void update(int& now, int l, int r, int i) 

    ---

73. { 

    ---

74. tree[nodeCnt] = tree[now]; 

    ---

75. now = nodeCnt++; 

    ---

76. assert(nodeCnt < MAXT); 

    ---

77. if (l == r) { 

    ---

78. tree[now].len = 1; 

    ---

79. tree[now].lenL = 1; 

    ---

80. tree[now].lenR = 1; 

    ---

81. tree[now].lenMax = 1; 

    ---

82. return; 

    ---

83. } 

    ---

84. int mid = (l + r) >> 1; 

    ---

85. if (i <= mid) 

    ---

86. update(tree[now].lson, l, mid, i); 

    ---

87. else update(tree[now].rson, mid + 1, r, i); 

    ---

88. push(tree[now]); 

    ---

89. assert(tree[now].len == (r - l + 1)); 

    ---

90. } 

    ---

91.  

    ---

92. TNode query(int now, int l, int r, int ql, int qr) 

    ---

93. { 

    ---

94. if (ql == l && qr == r) 

    ---

95. return tree[now]; 

    ---

96. int mid = (l + r) >> 1; 

    ---

97. if (qr <= mid) 

    ---

98. return query(tree[now].lson, l, mid, ql, qr); 

    ---

99. if (ql > mid) 

    ---

100. return query(tree[now].rson, mid + 1, r, ql, qr); 

     ---

101.  

     ---

102. TNode lson, rson, result; 

     ---

103. lson = query(tree[now].lson, l, mid, ql, mid); 

     ---

104. rson = query(tree[now].rson, mid + 1, r, mid + 1, qr); 

     ---

105. push(lson, rson, result); 

     ---

106. return result; 

     ---

107. } 

     ---

108.  

     ---

109. int query(int now, int n, int ql, int qr) 

     ---

110. { 

     ---

111. return query(now, 1, n, ql, qr).lenMax; 

     ---

112. } 

     ---

113. } 

     ---

114.  

     ---

115. using FST::query; 

     ---

116. using FST::update; 

     ---

117. using FST::init; 

     ---

118.  

     ---

119. struct Node 

     ---

120. { 

     ---

121. int value; 

     ---

122. int index; 

     ---

123. } a[MAXN]; 

     ---

124.  

     ---

125. int value[MAXN]; 

     ---

126. int root[MAXN]; 

     ---

127.  

     ---

128. bool cmp(const Node& a, const Node& b) 

     ---

129. { 

     ---

130. return a.value < b.value; 

     ---

131. } 

     ---

132.  

     ---

133. int main() 

     ---

134. { 

     ---

135. #ifndef ONLINE_JUDGE 

     ---

136. freopen("data.in", "r", stdin); 

     ---

137. #endif // ONLINE_JUDGE 

     ---

138. int n; 

     ---

139. int cnt; 

     ---

140. scanf("%d", &n); 

     ---

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

     ---

142. scanf("%d", &a[i].value); 

     ---

143. a[i].index = i; 

     ---

144. value[i] = a[i].value; 

     ---

145. } 

     ---

146. sort(a + 1, a + n + 1, cmp); 

     ---

147. sort(value + 1, value + n + 1); 

     ---

148. cnt = unique(value + 1, value + n + 1) - (value + 1); 

     ---

149. init(n, root[0]); 

     ---

150. for (int i = cnt, j = n; i >= 1; i--) { 

     ---

151. root[i] = root[(i + 1) % (cnt + 1)]; 

     ---

152. for (; j >= 1 && a[j].value == value[i]; j--) 

     ---

153. update(root[i], 1, n, a[j].index); 

     ---

154. } 

     ---

155.  

     ---

156. int m; 

     ---

157. int l, r, w; 

     ---

158. int low, upp, mid; 

     ---

159. scanf("%d", &m); 

     ---

160. for (; m--; ) { 

     ---

161. scanf("%d %d %d", &l, &r, &w); 

     ---

162. low = 0; 

     ---

163. upp = cnt + 1; 

     ---

164. // [low, upp) 

     ---

165. for (; upp - low > 1; ) { 

     ---

166. mid = (low + upp) >> 1; 

     ---

167. if (query(root[mid], n, l, r) >= w) 

     ---

168. low = mid; 

     ---

169. else upp = mid; 

     ---

170. } 

     ---

171. printf("%d\n", value[low]); 

     ---

172. } 

     ---

173. return 0; 

     ---

174. } 

     ---

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