请大佬翻译完毕后私信我谢谢! var a,b,c,d,f:array[1..1000]of longint; i,j,k,n,m,o:longint; procedure zx(p,q:longint); var i,j:longint; begin i:=0; while (i/(q-p+1))<(o/100) do begin inc(i); k:=k+b[p+i-1]+1; if i=1 then dec(k); a[d[p+i-1]]:=b[p+i-1]+1; if a[d[p+i-1]]>m then a[d[p+i-1]]:=m; end; if (p+i-1)=q t...