Wood Stick Problem

I begin to try some Linux coding so the chinese input become very poor on Ubuntu,

I decide to decribe this problem in Eng.

 

Find it from Zju acm problem Number 1025, have link here

 

 

I have  some idea to devive a whole collection of stick in to 3 part, one called bottom, one called middle, one called roof.

 

bottom contain 2 sticks, have min weight or have min length,

roof contian 2 sticks have max w or max l,

 

and the middle is rest of all sticks,

 

the using recursion , you can devide the middle again and again, you get a list of nodes in each contain 2 members , (or 1)

 

then we can from bottom to roof to find the min reset routine, ......... I think I can do it later.

 

 

something interesting is what tony (guy sit near my desk) told me, say we can find the one from left to right, first the min weight for instance,

 

then to get the BEST NEXT ONE. yes! I find it's a bright idea!

 

see code below: I tried using C++ in ubuntu, but still not so fimilar with it's complex list usage, so back to python, this is the first python code

I ever wirten in Linux, quite fun.

 

def PrintWoodArray(woodArray): for i in range(len(woodArray)): print "weight:"+str(woodArray[i].weight)+" length:"+str(woodArray[i].length); def FindMinWeight(woodArray): if len(woodArray)==0: return None; else: w=woodArray[0]; for i in range(len(woodArray)): if woodArray[i].weight<w.weight: w=woodArray[i]; return w; def FindNextWood(woodArray,arrangedLastWood): if woodArray.count==0: return None; else: w=None; for i in range(len(woodArray)): if woodArray[i].weight>arrangedLastWood.weight and woodArray[i].length>arrangedLastWood.length: if w==None: w=woodArray[i]; elif woodArray[i].weight<=w.weight and woodArray[i].length<=w.length: w=woodArray[i]; return w; class wood:pass; array=[4,9,5,2,2,1,3,5,1,4] woodArray=[]; ArrangedArray=[]; for i in range(0,len(array),2): w=wood(); w.weight=array[i]; w.length=array[i+1]; woodArray.append(w); minWeightWood=FindMinWeight(woodArray); while minWeightWood!=None: ArrangedArray.append(minWeightWood); woodArray.remove(minWeightWood); nextWood=FindNextWood(woodArray,ArrangedArray[len(ArrangedArray)-1]); while nextWood!=None: ArrangedArray.append(nextWood); woodArray.remove(nextWood); nextWood=FindNextWood(woodArray,ArrangedArray[len(ArrangedArray)-1]); minWeightWood=FindMinWeight(woodArray); PrintWoodArray(ArrangedArray); PrintWoodArray(woodArray);