题目描述
思路
最初我想把整体高度逆序排布为 Height[ n ] ,然后利用动态规划
创建一个列表 dp[ i ],意思是第 i 个导弹之前比它低的导弹数量
所以状态转移方程:
dp[ i ] = max{dp[ j ] + 1, 1}(0 <= j < i)
最开始代码如下:
Height = input().split()
H = [0 for _ in range(len(Height) + 1)]
dp = [0 for _ in range(len(Height) + 1)]
for i in range(len(Height)):
H[-(i + 1)] = int(Height[i])
print(H)
for i in range(1, len(Height)):
if(H[i] > H[i - 1]):
dp[i] = dp[i - 1] + 1
else:
dp[i] = dp[i - 1]
print(dp)
运行结果如下:
我发现问题出现在它一定是以第一个为初始拦截目标,并且判断大于小于关系的时候没有一个“可跳跃”的联系,因此我准备再添加一个 for 循环,让它获得联系
Height = input().split()
H = [0 for _ in range(len(Height))]
dp = [1 for _ in range(len(Height))]
for i in range(len(Height)):
H[-(i + 1)] = int(Height[i])
print(H)
for i in range(1, len(Height)):
for j in range(i):
if(H[j] < H[i] and dp[i] < dp[j] + 1):
dp[i] = dp[j] + 1
print(max(dp))
在这边可以获得最多拦截导弹个数,再经过思考,在之前,比如说“高僧斗法”那种题目里面,我一直定向思维,要从小到大的顺序,在循环方面,利用 max() 函数来进行返回值限定,但是在这边我后来改掉了逆向函数,发现其实效果是以昂的,不是说一定要利用原来的那种方法:
Height = input().split()
dp = [1 for _ in range(len(Height))]
for i in range(len(Height)):
Height[i] = int(Height[i])
for i in range(1, len(Height)):
for j in range(i):
if(Height[j] > Height[i] and dp[i] < dp[j] + 1):
dp[i] = dp[j] + 1
print(max(dp))
最终源码
Height = input().split()
dp_1 = [1 for _ in range(len(Height))]
dp_2 = [1 for _ in range(len(Height))]
for i in range(len(Height)):
Height[i] = int(Height[i])
for i in range(1, len(Height)):
for j in range(i):
if(Height[j] > Height[i] and dp_1[i] < dp_1[j] + 1):
dp_1[i] = dp_1[j] + 1
if(Height[j] < Height[i] and dp_2[i] < dp_2[j] + 1):
dp_2[i] = dp_2[j] + 1
print(max(dp_1))
print(max(dp_2))