有向直线k中值问题C语言,[算法设计与实验题解 prog322]有向直线 m 中值问题

【题目】:有向直线 m 中值问题

【来源】:算法设计与实验题解

【关键字】:动规

//================================================================================================

【分析】:有两个算法。

(1)、想象成一棵退化成一条线的树，用有向树k中值求解。

(2)、f[i,j]=f[k,j-1]+∑d[p]*d[p,k](p>k)f[i,j]指前i个数放j个的最小值，此方程可看作在k处放了一个服务站。

【小结】：貌似都过不了全部数据。

//================================================================================================

【代码】：

(1)、

var

n, m, i, j: longint;

w: array[0..200] of longint;

d: array[0..200,0..200] of longint;

f: array[-1..200,-1..200,-1..200] of

longint;

function min(x, y: longint):longint;

begin

if x < y then exit(x) else

exit(y);

end;

function work(x, u, j: longint):longint;

var

temp: longint;

begin

if f[x,u,j] <>

f[-1,-1,-1] then exit(f[x,u,j]);

temp := 0;

if x+1 <= n then temp :=

work(x+1,u,j);

f[x,u,j] := min(f[x,u,j],temp+w[x]*d[x,u]);

if j > 0 then

begin

temp := 0;

if x+1 <= n then temp := work(x+1,x,j-1);

f[x,u,j] := min(f[x,u,j],temp);

end;

exit(f[x,u,j]);

end;

begin

readln(n,m);

fillchar(d,sizeof(d),0);

for i := n downto 1 do

readln(w[i],d[i,i-1]);

for i := n downto 1 do

for j := i-1

downto 0 do

begin

d[i,j] := d[i,j+1]+d[j+1,j];

//writeln(i,' ',j,' ',d[i,j]);

end;

{for i := 0 to n do

for j := 0

to n do

writeln(i,' ',j,' ',d[i,j]);}

fillchar(f,sizeof(f),100);

writeln(work(0,0,m));

end.

(2)、

var

n, m, i, j, k, p, temp: longint;

cost: array[0..2000,0..5000] of longint;

d: array[0..2000,0..2000] of longint;

w: array[0..2000] of longint;

function min(x, y: longint):longint;

begin

if x < y then exit(x) else

exit(y);

end;

begin

readln(n,m);

fillchar(d,sizeof(d),0);

for i := n downto 1 do

readln(w[i],d[i,i-1]);

for i := n downto 1 do

for j := i-1

downto 0 do

d[i,j] := d[i,j+1]+d[j+1,j];

fillchar(cost,sizeof(cost),100);

cost[0,0] := 0;

for i := 1 to m do

begin

cost[i,i] := 0;

cost[0,i] := 0;

end;

for i := 1 to n do

begin

cost[i,0] := 0;

for j := 1 to i do

cost[i,0] := cost[i,0]+w[j]*d[j,0];

end;

{for i := 0 to n do

for j := 0

to m do

writeln(i,' ',j,' ',cost[i,j]);}

for i := 1 to n do

for j := 1

to min(i-1,m) do

begin

for k := 1 to i do

begin

temp := 0;

for p := k+1 to i do

temp := temp+w[p]*d[p,k];

temp := temp+cost[k-1,j-1];

cost[i,j] := min(cost[i,j],temp);

end;

//writeln(i,' ',j,' ',cost[i,j]);

end;

writeln(cost[n,m]);

end.