Hdu 4570 Multi-bit Trie（区间dp）

点击打开链接

Multi-bit Trie

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 468    Accepted Submission(s): 182

Problem Description

　　IP lookup is one of the key functions of routers for packets forwarding and classifying. Generally, IP lookup can be simplified as a Longest Prefix Matching (LPM) problem. That's to find the longest prefix in the Forwarding Information Base (FIB) that matches the input packet's destination address, and then output the corresponding Next Hop information.

　　Trie-based solution is the most wildly used one to solve LPM. As shown in Fig.1(b), an uni-bit trie is just a binary tree. Processing LPM on it needs only traversing it from the root to some leaf, according to the input packet's destination address. The longest prefix along this traversing path is the matched one. In order to reduce the memory accesses for one lookup, we can compress some consecutively levels of the Uni-bit Trie into one level, transforming the Uni-bit Trie into a Multi-bit Trie.
　　For example, suppose the strides array is {3, 2, 1, 1}, then we can transform the Uni-bit Trie shown in Fig.1(b) into a Multi-bit Trie as shown in Fig.1(c). During the transforming process, some prefixes must be expanded. Such as 11(P2), since the first stride is 3, it should be expanded to 110(P2) and 111(P2). But 110(P5) is already exist in the FIB, so we only store the longer one 110(P5).
　　Multi-bit Trie can obviously reduce the tree level, but the problem is how to build a Multi-bit Trie with the minimal memory consumption (the number of memory units). As shown in Fig.1, the Uni-bit Trie has 23 nodes and consumes 46 memory units in total, while the Multi-bit Trie has 12 nodes and consumes 38 memory units in total.

 

Input

　　The first line is an integer T, which is the number of testing cases.
　　The first line of each case contains one integer L, which means the number of levels in the Uni-bit Trie.
　　Following L lines indicate the nodes in each level of the Uni-bit Trie.
　　Since only 64 bits of an IPv6 address is used for forwarding, a Uni-bit Trie has maximal 64 levels. Moreover, we suppose that the stride for each level of a Multi-bit Trie must be less than or equal to 20.

 

Output

　　Output the minimal possible memory units consumed by the corresponding Multi-bit Trie.

 

Sample Input

  
  

   
   1
7
1
2
4
4
5
4
3
  
  

 

Sample Output

  
  

   
   38
  
  

题意：给n个数的数列a，n<=64，可以把这些数分成若干个不重合的区间，每个区间的数的个数<=20，建设这个区间为[ L,R]，那么这个区间的花费为a[l]*2^（R-L+1）。问最小花费为多少？

题解：简单区间dp。dp[i][j] 表示把i，j这个区间的数字分成若干个区间的最小花费。

代码如下：

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<math.h>
#include<string>
#include<set>
#include<map>
#define nn 610000
#define inff 0x3fffffff
using namespace std;
typedef __int64 LL;
typedef unsigned __int64 ULL;
const LL inf64=inff*(LL)inff;
int n;
int a[110];
LL dp[110][110];
LL dfs(int l,int r)
{
    if(dp[l][r]!=-1)
        return dp[l][r];
    LL ix=1;
    if(r-l+1<=20)
    {
        dp[l][r]=(LL)a[l]*(ix<<(r-l+1));
    }
    else
        dp[l][r]=inf64;
    for(int i=l;i<r;i++)
    {
        dp[l][r]=min(dp[l][r],dfs(l,i)+dfs(i+1,r));
    }
    return dp[l][r];
}
int main()
{
    int t,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(dp,-1,sizeof(dp));
        for(i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        printf("%I64d\n",dfs(1,n));
    }
    return 0;
}