Multi-bit Trie

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

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

Source

Recommend

/*

*/

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>

#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)

#define bug printf("hihi\n")

#define eps 1e-8
typedef __int64 ll;

using namespace std;

#define INF 0x3f3f3f3f
#define N 65

ll dp[N];
ll a[N];
int n;
int main()
{
int i,j,t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%I64d",&a[i]);

}
memset(dp,INF,sizeof(dp));
for(i=n+1;i<=n+20;i++)
dp[i]=0;
dp[n]=a[n]*2;

for(i=n;i>=1;i--)
for(j=i+1;j<=min(i+20,n+1);j++)//在j这个位置分开
{
dp[i]=min(dp[i],a[i]*(1<<(j-i))+dp[j]);
}
printf("%I64d\n",dp[1]);
}
return 0;
}

• 本文已收录于以下专栏：

Hdu 4570 Multi-bit Trie（区间dp）

• 2014年10月26日 15:17
• 259

HDU 4570 - Multi-bit Trie(区间DP)

• u013534690
• 2015年05月13日 13:11
• 314

HDU 4570 Multi-bit Trie (区间DP)

Multi-bit TrieTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) T...
• mrlry
• 2016年08月30日 18:53
• 103

hdu 4570 Multi-bit Trie 【区间dp】

• zoro_n
• 2017年07月10日 10:35
• 55

hdu 4570 Multi-bit Trie （区间DP）

Problem Description 　　IP lookup is one of the key functions of routers for packets forwarding and c...
• hndu__lz
• 2016年08月09日 18:00
• 83

HDU 4570 Multi-bit Trie(区间DP)

• clx55555
• 2016年11月15日 12:19
• 120

hdu 4570 Multi-bit Trie

• carryheart
• 2016年08月03日 19:56
• 324

HDU 4570 Multi-bit Trie 解题报告

• u010638776
• 2013年07月06日 12:06
• 1063

HDU - 4570 Multi-bit Trie 2013长沙邀请赛

• canghai_wangzi
• 2017年05月30日 16:32
• 99

HDU4570:Multi-bit Trie(区间DP)

Problem Description 　　IP lookup is one of the key functions of routers for packets forwarding and cl...
• libin56842
• 2013年08月01日 15:20
• 2169

举报原因： 您举报文章：HDU 4570 Multi-bit Trie（区间dp） 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)