注意:快排每次排一遍要炸!

P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G

....
by _bestknife @ 2016-04-24 10:39:08


呃呃呃呃呃呃呃呃呃呃呃呃呃呃呃
by die柠之恋 @ 2016-08-20 16:04:04


```cpp begin for a:=1 to 2 do for b:=n downto 1 do if w[b]<w[b-1] then swap(w[b],w[b-1]); end; 每次找两个最小值就行了 ```
by zkcy @ 2016-09-04 22:44:06


|