下面代码是一维数组优化 0/1背包的核心片段，横线处应填入（ ）
for i in range(1, n + 1):
for c in range(W, w[i] - 1, -1):
__________
dp[c] = max(dp[c], dp[c + w[i]] + v[i])
dp[c] = min(dp[c], dp[c - w[i]] + v[i])
dp[c] = dp[c - w[i]] + v[i]
dp[c] = max(dp[c], dp[c - w[i]] + v[i])