摘要:
最简单的区间贪心,但是考察细心。注意事项:1、考虑s>t的情况2、读入的时候要把s、t分别转换为(s+1)div 2和(t+1)div 2代码:Program poj1083;//By_ThispoetConst maxn=200;Var t,i,j,k,m,n :Longint; heap,l,r :Array[1..maxn*2]of Longint; heap_size :Longint; Procedure Down(i:Longint);var j:Longint;begin while ((i<<1)<=heap_size) do begin ... 阅读全文