|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
April 11th, 2004, 01:09 AM
|
||||
|
||||
|
Assignment needs help
Suppose we have a given arrangement S of n
non-negative numbers {S1, ?., Sn} and an integer N. Can you suggest some algorithm for "cutting S into N or fewer ranges in a certain way that can minimize the maximum sum over all the ranges?" Thank Gurus so much -Fna
|
|
#2
April 12th, 2004, 11:09 AM
|
||||
|
||||
|
Thanks for having read my thread without giving any answers, your looks should be pretty...
You know, i think this is very important...My religion is Buddhism, I beleive in Guanying Mercy goddess, you spent 3 minutes typing down your explanation about my problem, perhaps my Mercy goddess would bless you 3 x little = 3little = much how is that ? C'mon, help me ! if anyone know mandarin... ngo: kon ngo: hmm zhi le, true true !!!
|
|
#3
April 13th, 2004, 01:36 PM
|
||||
|
||||
|
Most people here will help out with an assignment if you've already done some of the work but are stuck, or need pointers. However, nobody here will do your work for you.
__________________
"Science is constructed of facts as a house is of stones. But a collection of facts is no more a science than a heap of stones is a house." - Henri Poincare
|
|
| Viewing: Dev Shed Forums > Programming Languages - More > Software Design > Assignment needs help |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
