Can we consided the problem as optimal sheduling
task raplacing a value ak with interval [ak.ak+R)
and applying greedy algotithm.
Yes!
Dilworth applying.
Having confirmed by Dilworth optimal number M
it is simply to find O(n) of right dividing:
1,2,3,1,2,3,1,2,3.. if M==3.
My O(n) 0.125Ac one of the best, but respect to them
who have 0.03 because they can build quick implementation
of simple processes.
Edited by author 17.10.2007 14:38

Edited by author 18.10.2007 10:36

Edited by author 18.10.2007 10:36

Edited by author 18.10.2007 11:03