HDU-5534-Partial Tree【2015长春赛区】【完全背包】

<pre name="code" class="cpp">#include<iostream
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int inf = 199999999;
const int maxn = 3000;
int dp[maxn];
int f[maxn];
int w[maxn];
int v[maxn];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
memset(dp,0,sizeof(dp));
int n;
scanf("%d",&n);
for(int i = 1; i<n; i++)
scanf("%d",&f[i]);
for(int i =1 ; i<n; i++)
{
w[i]  = i -1;
v[i] = f[i] - f[1];
}
for(int i = 1;i<=n-2;i++)
{
dp[i]=  -inf;
}
for(int i = 1; i<n; i++)
{
for(int j = w[i]; j<=n-2; j++)
{
dp[j] = max(dp[j],dp[j-w[i]]+v[i]);
}
}
printf("%d\n",dp[n-2]+n*f[1]);
}
}