# 动态规划-01背包问题

```python
import numpy as np

weight=[2,2,6,5,4]
value=[3,6,5,4,6]
weight_most=10


def bag_0_1(weight,value,weight_most): # return max value

    num = len(weight)
    weight.insert(0,0) # 前0件要用
    value.insert(0,0)  # 前0件要用

    bag=np.zeros((num+1,weight_most+1),dtype=np.int32) # 下标从零开始

    for i in range(1,num+1):
        for j in range(1,weight_most+1):
            if weight[i]<=j:
                bag[i][j]=max(bag[i-1][j-weight[i]]+value[i],bag[i-1][j])
            else:
                bag[i][j]=bag[i-1][j]
    # print(bag)
    return bag[-1,-1]

result=bag_0_1(weight,value,weight_most)
print(result)
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://im-qianuxn.gitbook.io/pytorch/ji-suan-ji/shua-ti/si-xiang-lei/dong-tai-gui-hua/0-1-bei-bao-wen-ti.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.