HDU - 5534 Partial Tree

HDU - 5534 Partial Tree

dp+多重背包=不会……虽然代码看着好短，但是就是看不懂呀QAQ

n mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two nodes are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.

You find a partial tree on the way home. This tree has n nodes but lacks of n−1 edges. You want to complete this tree by adding n−1 edges. There must be exactly one path between any two nodes after adding. As you know, there are nn−2 ways to complete this tree, and you want to make the completed tree as cool as possible. The coolness of a tree is the sum of coolness of its nodes. The coolness of a node is f(d), where f is a predefined function and d is the degree of this node. What’s the maximum coolness of the completed tree?
Input
The first line contains an integer T indicating the total number of test cases.
Each test case starts with an integer n in one line,
then one line with n−1 integers f(1),f(2),…,f(n−1).

1≤T≤2015
2≤n≤2015
0≤f(i)≤10000
There are at most 10 test cases with n>100.
Output
For each test case, please output the maximum coolness of the completed tree in one line.
Sample Input
2
3
2 1
4
5 1 4
Sample Output
5
19

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm> 
#include<cstring>
#include<string>
#define N 1010
#define maxn 2111
const long long INF = 1e8;
using namespace std;
long long dp[maxn];
long long f[maxn];
int n;
int main()
{
    int t,gg;
    long long ans;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=1;i<n;i++){
            scanf("%lld",&f[i]);
        }
        ans=f[1]*n;
        gg=f[1];
        for(int i=0;i<n-1;i++){
            f[i]=f[i+1]-gg;
        }
        for(int i=0;i<=n-2;i++){
            dp[i]=-INF;
        }
        dp[0]=0;
        for(int i=1;i<=n-2;i++){
            for(int j=0;j<=n-2;j++){
                if(i+j<=n-2){
                    dp[i+j]=max(dp[i+j],dp[j]+f[i]);
                }
            }
        }
        printf("%lld\n",ans+dp[n-2]);
    }
    return 0;
}