这道可以安放两个护盾,分别在节点3和节点5上,以保护最大的设备价值。下面是输出格式的代码实现:
n, s, k = map(int, input().split()) |
|
dist = list(map(int, input().split())) |
|
values = list(map(int, input().split())) |
|
def dfs(node, index): |
|
nonlocal visited, total_value |
|
visited[node] = True |
|
total_value += values[node] |
|
for i in range(n): |
|
if not visited[i] and abs(i - node) <= k: |
|
if dfs(i, i) > 0: |
|
return True |
|
visited[i] = True |
|
return False </ |