Dwylkz

二叉搜索树Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 218    Accepted Submission(

/* I can hardly belive that I hadn't read this problem clearly. It's Fu*king easy!!!!! Sh*t, we could got the ticket to Tianjin if I had fu*k this fu*king problem! Clam down..... L/R as a poi

/* Maintain two domain when we update the splay tree. x->s[i] as the sum of aj which j mod 5 == i in subtree x x->sz as the size of subtree x Then, Root->s[3] is the sum of whole set. k = t

Double StackFlexible application.Splay is ok too.(Compile with C++....)