I will Do iT @ hlyblog.net

Editor 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=4699 栈 A, B维护光标之前(之后)的序列                          I x A.push(x)                          D A.pop()                          L B.push

Data Structure? Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2166    Accepted Submission(s): 692 Problem Description Data struc

解法请看http://blog.csdn.net/diannaok/article/details/7959423 挺又收获的。以前虽然会区间修改，但不熟练。没想到可以通过k来解决问题。 A Simple Problem with Integers Time Limit: 5000/1500 MS (Java/Others)    Memory Limit: 32768/32

E. Little Girl and Problem on Trees time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A little girl loves pro

莫队算法。。不过 TLE