下载APP
举一反三
【单选题】01背包的一维状态转移方程是（i表示物品编号，j表示背包容量）
A.
dp[i] = max(dp[j], dp[j-w[i]]+v[i])
B.
dp[j] = max(dp[i], dp[j-w[i]]+v[i])
C.
dp[j] = max(dp[j], dp[j-w[i]]+v[i])
D.
dp[j] = max(dp[j], dp[j-w[j]]+v[j])
【单选题】有如下事件过程：Private Sub Form_Load() Show Dim Arr() As Variant Arr = Array(1, 3, 5, 7, 9, 11, 13, 15) Call converse(Arr) For i = 0 To 7 Print arr(i); Next iEnd Sub 以上程序的功能是，通过调用Converse过程，将数组Arr中的元素逆序存放并输出...
A.
Private Sub converse(dim a() as Variant ) Dim T For i = LBound(A) To UBound(A) T = a(i) a(i) = a(UBound(A) - i) a(UBound(A) - i) = T Next i End Sub
B.
Private Sub converse(dim a() as Variant) Dim T Dim J As Integer J = (LBound(A) + UBound(A)) / 2 For i = LBound(A) To J T = a(i) a(i) = a(UBound(A) - i) a(UBound(A) - i) = T Next i End Sub
C.
Private Sub converse(a() As Variant) Dim T For i = LBound(A) To UBound(A) T = a(i) a(i) = a(UBound(A) - i) a(UBound(A) - i) = T Next i End Sub
D.
Private Sub converse(a() As Variant) Dim T Dim J As Integer J = Int((LBound(A) + UBound(A)) / 2) For i = LBound(A) To J T = a(i) a(i) = a(UBound(A) - i) a(UBound(A) - i) = T Next i End Sub