信息學(xué)-集訓(xùn)隊(duì)作業(yè)

回家后就要過年了和想為朋友們表演一下自己的廚藝——做corn*.innn-1uvuv輸出文件corn*.outn1,2,3...nx,y

yxi1i412232401001011假設(shè)參考解的邊長(zhǎng)為Best，你的邊長(zhǎng)為Ans，則你的得分為10AnsBest91Ans>Best，其中[]你可以使用checkerchecker其中TestNo為測(cè)試點(diǎn)。例如你已經(jīng)得到了數(shù)據(jù)5的輸出corn5.out，可checker來測(cè)試你的輸出是否合法。執(zhí)行此命令時(shí)corn5.in和corn5.out請(qǐng)妥善保存輸入文件*.in和你的輸出*.out90它的橫向“壓縮”得太厲害了。來看一下用這種方法對(duì)于test10FPgraph，“仍然枚舉所有的樹根。在處理第一層的時(shí)候給每棵預(yù)，“ 通過Graph所畫出的對(duì)于test10的大致圖像：用R[i,j]表示將以i為樹根的放在寬度為j的空間里，且根放在最頂層時(shí)所（R1WH當(dāng)然也可以在設(shè)一個(gè)數(shù)組D[i,j]表示將以i為樹根的放在高度為j的空間R[i,j]的時(shí)候就不需要二分了。同時(shí)usesgraph,crt;d:array[1..2000,1..2]oflongint;assign(fin,infile);reset(fin);assign(fout,outfile);reset(fout);initgraph(gd,gm,'');forc1:=1tondobeginCircle(d[c1,1]*big+10,d[c1,2]*big+10,bigdiv2); forc1:=1ton-1dobegin主程序{$APPTYPEprogramcorn;b:array[1..maxn]ofinteger;r:array[1..maxn,1..maxr]ofinteger;ansd,d:array[1..maxn]ofarr;height:array[1..maxn]ofinteger;used:array[1..maxn]ofboolean;procedurereaddata;forc1:=1ton-1dobegininc(d[e2].sonnum);d[e2].b[d[e2].sonnum]:=e1;proceduredfs(o:integer);forc1:=1tod[o].sonnumifnotused[d[o].b[c1]]thenbeginfunctionmax(o1,o2:integer):integer;ifo1>o2thenmax:=o1elsemax:=o2;proceduresub1;height:array[1..maxr]ofinteger;q:array[1..maxn]ofinteger;forroot:=1tondobegindfs(root);d[root].father:=0;q[1]:=root;d[root].x:=1;d[root].y:=1;open:=0;closed:=1;w:=1;h:=1;forc1:=1tod[q[open]].sonnumifd[q[open]].b[c1]<>d[q[open]].fatherthenbeginifopen=1thenbeginendelsebeginifopen>1thenbeginendelsebeginforc2:=1tod[d[q[open]].b[c1]].xdobeginifd[d[q[open]].b[c1]].x>wthenw:=d[d[q[open]].b[c1]].x;untilifmax(w,h)<ansthenbeginfunctionsolve(o,range:integer):integer;functionworkwidth(o,range:integer):integer;i:=1;j:=range;k:=1;whilei<jdobegink:=(i+j)divifsolve(o,k)<=rangethenJ:=kelsei:=k+1;ifrange=0thenworkwidth:=infelseifsolve(o,i)<=rangethenworkwidth:=ielseworkwidth:=inf;procedureswap(varo1,o2:integer);k:=o1;o1:=o2;o2:=k;functionsolve(o,range:integer):integer;ifr[o,range]>0thenbeginforc1:=0torange-1dobeginleft:=1;right:=1;forc2:=1tod[o].sonnumifd[o].b[c2]<>d[o].fatherthenbeginifleft+e1<right+e2thenbeginendelsebeginifmax(left,right)<r[o,range]thenbeginifk>0thenbeginleft:=0;forc2:=1tod[o].sonnumifd[o].b[c2]<>d[o].fatherthenbeginifleft+e1<right+e2thenbeginendelsebeginifmax(left,right)<r[o,range]thenbeginendelsesolve:=inf;proceduresub2;forroot:=1tondobeginwrin('ANS=',ans);dfs(root);d[root].father:=0;forc1:=1tomaxrdobeginifr