状态转移方程: dp[i][j] = max( dp[i][j-1], dp[i-1][j-num[i]] + suma[j] - suma[j-num[i]] ); dp[i][j] 表示前 i 个段在前 j 个数中取时的最大和;suma[ j ] 表示第一个数到第 j 个数的和
ac代码如下:
#include <iostream>
#include <cstdio>
using namespace std;
inline int max( int a, int b ){
return ( a > b ? a : b );
}
int main(){
int n, m, num[32], sumnum[33], a[1200], suma[1200], dp[33][1200];
while( scanf( "%d", &n ) && n != 0 ){
cin >> m;
memset( num, 0, sizeof( num ) );
memset( sumnum, 0, sizeof( sumnum ) );
memset( a, 0, sizeof( a ) );
memset( suma, 0, sizeof( suma ) );
memset( dp, 0, sizeof( dp ) );
for( int i = 1; i <= m; i++ ){
cin >> num[i];
sumnum[i] = num[i] + sumnum[i-1];
}
for( int i = 1; i <= n; i++ ){
cin >> a[i];
suma[i] = suma[i-1] + a[i];
}
for( int i = 1; i <= m; i++ ){
for( int j = sumnum[i]; j <= n; j++ ){
dp[i][j] = max( dp[i][j-1], dp[i-1][j-num[i]] + suma[j] - suma[j-num[i]] );
}
}
cout << dp[m][n] << endl;
}
return 0;
}