| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
in English :)In Reply To:看起来像是google翻译的。。 Posted by:hysramp at 2008-02-20 11:59:37 Ok. Sorry. I have a initial set of N numbers with the ID 0. To this set I can apply three functions: 1) Split(Poz, ID1, ID2): Splits the set with id ID1 into two sets. The first set keeps the id ID1 and the first Poz elements (1, 2, ..., Poz) and the second sets takes the id ID2 and the rest of the elements (Poz+1, Poz+2, ... Set_length). 2) Join(ID1, ID2): Joins (! in this order !) the set ID1 with the set ID2 and ID2 is cleared (this ID can be reuse on a Split operation). 3) Query(ID, P, Q): the minimum element from the Pth element to the Qth element of the set with id ID. Example: N = 7; S_0 =(1,2,3,4,5,6,7) Split(3,0,1) => S_0 = (1,2,3) and S_1 = (4,5,6,7) Split(2,1,2) => S_0 = (1,2,3) S_1 = (4,5) and S_2 = (6,7) Join(2,0) => S_1 = (4,5) and S_2 = (6,7,1,2,3); Split(1,1,0) => S_1 = (4) S_0 = (5) and S_2 = (6,7,1,2,3) Query(2,2,3) = 1 Query(1,1,1) = 4 Query(2,4,5) = 2 Sorry for my previous bad (google) Chinese. Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator