背包
def knapsack(p, w, v):
n = len(p)
lists,arr = [],[[0] * (v + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in range(1, v + 1):
if w[i - 1] <= j: # 如果当前物品的体积不超过背包的容量,p[i-1]当前物品的价值,w[i-1]当前物品的体积
arr[i][j] = max(arr[i - 1][j], p[i - 1] + arr[i - 1][j - w[i - 1]])
else: #如果当前物品的体积超过背包的容量
arr[i][j] = arr[i - 1][j]
remain = v
for i in range(n, 0, -1):
if arr[i][remain] > arr[i - 1][remain]:
lists.append(i - 1) # (i-1)为当前物品的编号
remain -= w[i - 1] # 容积减去已经找到的物品,再次寻找
return arr[-1][-1], lists
if __name__ == '__main__':
p = [6,3,5,4,6] # 物品的价值
w = [2,2,6,5,4] # 物品占的体积
v = 10 # 背包的容量
print(knapsack(p, w, v))
邮局选址
def siteSelectionQuestion1(arr, num):
if arr == None or len(arr) == 0 or num < 1 or len(arr) < num:
return 0
w = [[0 for i in range(len(arr))] for j in range(len(arr))]
for i in range(len(arr)):
for j in range(i+1, len(arr)):
w[i][j] = w[i][j-1] + arr[j] - arr[(i+j) // 2]
dp = [w[0][i] for i in range(len(arr))]
for i in range(1, num):
for j in range(len(arr)-1, i-1, -1):
minDistance = sys.maxsize
for k in range(i-1, j):
minDistance = min(minDistance, max(dp[k], w[k+1][j]))
dp[j] = minDistance
return dp[-1]
字符串操作等:
最长递增子串
import bisect
while True:
try:
a = int(input())
b = map(int,input().split())
c = []
for i in b:
x = bisect.bisect_left(c,i)
if x == len(c):
c.append(i)
else:
c[x] = i
print(len(c))
except:
break
跳跃比赛:
arr=list(map(int,input().split()))
dis=0
step=0
step_max=1
lis=[]
while dis<len(arr):
step+=1
# print(step)
for i in range(index,step_max):
if arr[i]+i+1>step_max:
step_max=arr[i]+i+1
lis.append(arr[i])
index=i
break
dis=step_max
# print(dis)
print(step)
print(lis)