假设我们现在已经有了一个顺序
大臣左手的数字为
A
[
1
]
A[1]
A[1] ~
A
[
n
]
A[n]
A[n]，右手的数字为
B
[
1
]
B[1]
B[1] ~
B
[
n
]
B[n]
B[n]，国王则为
A
[
0
]
,
B
[
0
]
A[0],B[0]
A[0],B[0]
现在我们交换位置为
i
,
i
+
1
i,i+1
i,i+1两位大臣之间的位置
交换前，两人的收益分别为
1
B
[
i
]
∏
j
=
0
i
−
1
A
[
j
]
\frac{1}{B[i]}{\prod_{j=0}^{i-1}A[j]}
B[i]1∏j=0i−1A[j]和
A
[
i
]
B
[
i
+
1
]
∏
j
=
0
i
−
1
A
[
j
]
\frac{A[i]}{B[i+1]}{\prod_{j=0}^{i-1}A[j]}
B[i+1]A[i]∏j=0i−1A[j]
交换后，两人的收益分别为
1
B
[
i
+
1
]
∏
j
=
0
i
−
1
A
[
j
]
\frac{1}{B[i+1]}{\prod_{j=0}^{i-1}A[j]}
B[i+1]1∏j=0i−1A[j]和
A
[
i
+
1
]
B
[
i
]
∏
j
=
0
i
−
1
A
[
j
]
\frac{A[i+1]}{B[i]}{\prod_{j=0}^{i-1}A[j]}
B[i]A[i+1]∏j=0i−1A[j]，其余大臣收益不变
提取公因式后，发现交换前为
max
(
1
B
[
i
]
,
A
[
i
]
B
[
i
+
1
]
)
\max(\frac{1}{B[i]},\frac{A[i]}{B[i+1]})
max(B[i]1,B[i+1]A[i])，交换后则为
max
(
1
B
[
i
+
1
]
,
A
[
i
+
1
]
B
[
i
]
)
\max(\frac{1}{B[i+1]},\frac{A[i+1]}{B[i]})
max(B[i+1]1,B[i]A[i+1])
两式子都同乘
B
[
i
]
∗
B
[
i
+
1
]
B[i]*B[i+1]
B[i]∗B[i+1]后
则只要比较
max
(
B
[
i
+
1
]
,
A
[
i
]
∗
B
[
i
]
)
\max(B[i+1],A[i]*B[i])
max(B[i+1],A[i]∗B[i])和
max
(
B
[
i
]
,
A
[
i
+
1
]
∗
B
[
i
+
1
]
)
\max(B[i],A[i+1]*B[i+1])
max(B[i],A[i+1]∗B[i+1])
所以当满足
A
[
i
]
∗
B
[
i
]
>
A
[
i
+
1
]
∗
B
[
i
+
1
]
A[i]*B[i]>A[i+1]*B[i+1]
A[i]∗B[i]>A[i+1]∗B[i+1]时，交换会让结果更优
评论
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
查看更多评论
添加红包
