动态方法在分配方案中应用.pdfVIP

Assignment1:Solution

Question1:DynamicProgramming

(a)P(x,k)=maxA[j]–minA[j]ifk=1[5marks]

j=1..xj=1..x

P(x,k)=mins=1..x-1

{P(s,k-1)+maxA[j]–minA[j]}ifk1[10marks]

j=s+1..xj=s+1..x

(b)Computethegapofasubarray:O(n)timeperoperation[3marks]

2

Timeforeachentry:O(x)*O(n)=O(n)

NumberofentriesinDPtable:O(kn)

23

Totaltimecomplexity:O(kn)*O(n)=O(kn)[2marks]

(c)

n

1234567

1012