集訓隊作業(yè)ural競賽

1、題目來源Ural1613.ForFansof題目來源Ural1613.ForFansof題目描述讀入n 個數(shù)（0n=r then exit; 源程序constvar a:array0.maxnof long ; hp:array0.maxnoflong ; i,j,k,n,num,x,y,q:long ;var i,j,x,y,p:longif l=r then exit; i:=l; j:=r;whileijdowhile(ix)or(hpjy)and(aj=x)dodec(j); ai:=aj; hpi:=hpj;aj:=ai; hpj:=hpi;ai:=x;hpi:=y;Qsort(l,

2、i-1);Qsort(i+1,r); function ;varm:long ;whilel=rdobegin m:=(l+r) div 2;then exit(true)elseif(numam)or(num=am)and(yhpm)thenr:=m-1 else l:=m+1;fori:=1tondoread(ai); fori:=1tondohpi:=i; fori:=1toqdobegin ifsearch(1,n)thenwrite(1)elsewrite(0); 原1613.ForFansofTimeLimit:1.0second MemoryLimit:64Haveyouever

3、 every year thought about how many people are transported by acityten-millionpopulationwheretram twice a tthereare ncities withtrams onthe planetnscountedforeachofthemthenumberofpeopletransported during last year. They compiled a table, in which cities were原1613.ForFansofTimeLimit:1.0second MemoryLi

4、mit:64Haveyouever every year thought about how many people are transported by acityten-millionpopulationwheretram twice a tthereare ncities withtrams onthe planetnscountedforeachofthemthenumberofpeopletransported during last year. They compiled a table, in which cities weresortedalphabetically.Since

5、citynameswereinessentialforthey were later replaced by numbers from 1 to n. A search engineworks with these data must be able to answer quickly a query of the followingtype:isthereamongthecitieswithnumbersfromltorsuchofthiscitytransportedexactlyxpeopleduringlast implement this module of the system.t

6、thetrams year.You contains egern,a n 70000. The second line list ofegersseparatedwithsisticheformofhislist,theithnumberthe number All numbers he third bytramsoftheithcityduringlastthe list itive and do not exceed thenumberofqueriesqis0qisatriplenextqegersl,and hequeries.Each of separated space; rn;0 xOutputastringoflength qwhichtheithsymbolis“1”answertothe ithquery isaffirmative,and “0”S51234567666666314159351 5 4343