Sothan

HDU 5306 Gorgeous Sequence There is a sequence a of length n. We use ai to denote the i-th element in this sequence. You should do the following three types of operations to this sequence. 0 x y t: For every x≤i≤y, we use min(ai,t) to replace the original

HDU 1698 Just a Hook 线段树区间更新求和 In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.

Billboard Problem Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all poss

HUD 5323 Solve this interesting problem dfs剪枝搜索，重构线段树 Have you learned something about segment tree? If not, don’t worry, I will explain it for you. Segment Tree is a kind of binary tree, it can be defined as this: - For each node u in Segment Tree, u has

    常规的线段树可以用lazy标志来实现线段树的区间更新（区间覆盖，区间加减定值等），但是形如下面操作1却不是很好处理For all , change Ai to min(Ai, x)Query for the sum of Ai in [l, r]        可以参考2016年国家集训队论文集中的“区间最值与历史最值问题”——吉如一，关于求区间和、区间最值的问题可以用常规的线段树轻松解决...