摘要：
Bracket SequenceTime Limit:3000MSMemory Limit:65536KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionThere is a sequence of brackets, which supports two kinds of operations.1. we can choose a interval [l,r], and set all the elements range in this interval to left br... 阅读全文
摘要：
A Simple Tree ProblemTime Limit:3 Seconds Memory Limit:65536 KBGiven a rooted tree, each node has a boolean (0 or 1) labeled on it. Initially, all the labels are 0.We define this kind of operation: given a subtree, negate all its labels.And we want to query the numbers of 1's of a subtree.InputM 阅读全文