The "BZOJ1095" "ZJOI2007" hide hide and seek line tree maintains the compression of the parentheses sequence data structure. __bzoj1095

Link:

#include <stdio.h>
int main ()
{
    puts ("reprint please indicate the source [Vmurder] Thank you");
    Puts ("URL: blog.csdn.net/vmurder/article/details/44829703");
}

The puzzle :

First of all because this problem is so god that I actually do not have this problem, so you may wish to introduce the parentheses sequence maintenance tree.

is actually false, is a point is swept into the stack, the sequence with an opening parenthesis, and then add a character (can not add), point out the stack when a closing parenthesis.

And then the distance between two points is two points in the middle of the sequence of the brackets, delete some of the matching parentheses after the answer, for example, (() () () (() () () () (() () () (, () () () () () () () () () () () () (() () () (

Then how does this problem maintain information in parentheses?
......
First we have the code for [Hzwer Benniu]:
Http://hzwer.com/5247.html
Second, we have [~ ~ Island Niang ~ ~] Comments:
http://www.shuizilong.com/house/archives/bzoj-1095-zjoi2007hide-%E6%8D%89%E8%BF%B7%E8%97%8F/
Finally, we also have the transfer formula [Cao Chin Xiang]
http://wenku.baidu.com/link?url=o6-p5-t1gye2v4huhozpldk__qud-jlxykjpv4hz– U2kczvfhl-vmmtmrgqpd3ze8gq2q7qc6heyw4x4beq33zoi3d6g_f53krcymdrfvo

Of course the practice of chain division we have the [WJBZBMR]:
Http://hi.baidu.com/wjbzbmr/item/14ea8b7cb06bea36714423d0

......
In addition to this formula Ah, please refer to the code to understand.
Because some of the variable names are already mixed. Code:

(Grilled hzwer, grilled very ugly, so do not put up Qwq)