chess offline game

], PRE[MAXN], ANS[MAXN];structnode{intL, R, id;} FEI[MAXN];BOOLCMP (node x, node Y) {returnX.RvoidPushup (intRT) {Max[rt]=max (max[rt1],max[rt1|1]);}voidUpdate (intPintXintLintRintRT) {if(L==R) {if(max[rt]return; }intMid=l+r>>1;if(PElseUpdate (P,x,rson); Pushup (RT);}intQuery (intllintRrintLintRintRT) {if(LLreturnMAX[RT]; }intMid=l+r>>1, ans=0;if(Llif(Rr>mid) Ans=max (Ans,query (Ll,rr,rson));returnAns;}intMain () {intT, N, I, Q, R, J, TMP;scanf("%d", t); while(t--) {scanf("%d", n);memset(Max,0,s

],maxn[n];structque{intL,r,id;} Q[n];BOOLcmp (que x,que y) {returnx.rY.R;}voidPushup (intRT) {Maxv[rt]=max (maxv[rt1],maxv[rt1|1]);}voidBuildintLintRintRT) {Maxv[rt]=1; if(L==R)return; intM= (l+r) >>1; Build (Lson); Build (Rson);}voidUpdateintPintVintLintRintRT) { if(l==R) {Maxv[rt]=Max (MAXV[RT],V); return; } intM= (l+r) >>1; if(pm) update (P,v,lson); ElseUpdate (P,v,rson); Pushup (RT);}intQueryintLintRintLintRintRT) { if(lR) { returnMaxv[rt]; } intM= (l+r) >>1; intnum=0;

arrangement of 1~n, and then given Q query, each time an interval [l,r], in the [l,r] this interval to find the largest gcd (a, B), {lAnalysisHere I link a Daniel's puzzle, I think he is very good at solving the puzzle. I just add that HDU has a set of data is definitely wrong,1111 1The correct answer is 1. However, Hangzhou Electric's data is indeed 0 ...I wa for a few hours but I can't solve it. Tragedy, Woo-hoo ~~~~~/****************************>>>>headfiles Copyright NOTICE: This a

| We have carefully selected several similar problems for you:5283 5282 5280 5279 5278Test instructions: There are n numbers, which is an arrangement of the 1~n. There are m inquiries, each asking an interval, asking from this interval, take two numbers of the largest greatest common divisor.First, the query by the right interval in ascending order, in the array is inserted sequentially, record the current number of factors where the occurrence of the position, if there is a previous occurrence