题目:http://poj.org/problem?id=2193
分析:数位DP,很容易想到如果令f(n, m)表示从m个数中选择n个使之满足后一个是前一个至少2倍的关系,则对于数m,我们有两种操作:
(1)选择m,则我们还要从1~m/2中选择n-1个数
(2)不选m,则我们可以从1~m-1中选择n个数
另外,当n=1时,显然有m种序列,从而有f(n, m) = f(n-1, m/2) + f(n, m-1),时间复杂度是O(nm)
写成递归的形式
#include <cstdio>
#define MAX_N 10
#define MAX_M 2000
typedef __int64 LL;
LL f[MAX_N + 1][MAX_M + 1] = {0};
LL dp(int n, int m)
{
if(n == 1) return m;
if(1 << (n-1) > m) return 0;
if(f[n][m]) return f[n][m];
return f[n][m] = dp(n-1, m>>1) + dp(n, m-1);
}
int main()
{
int t = 1, test, n, m;
for(scanf("%d", &test); t <= test; ++t){
scanf("%d%d", &n, &m);
printf("Case %d: n = %d, m = %d, # lists = %I64d\n", t, n, m, dp(n, m));
}
return 0;
}
写成递推的形式
#include <cstdio>
#define MAX_N 10
#define MAX_M 2000
typedef __int64 LL;
LL f[MAX_N + 1][MAX_M + 1] = {0};
void init()
{
for(int m = 1; m <= MAX_M; ++m) f[1][m] = m;
for(int n = 2; n <= MAX_N; ++n)
for(int m = 1<<(n-1); m <= MAX_M; ++m)
f[n][m] = f[n][m-1] + f[n-1][m>>1];
}
int main()
{
int t = 1, test, n, m;
for(init(), scanf("%d", &test); t <= test; ++t){
scanf("%d%d", &n, &m);
printf("Case %d: n = %d, m = %d, # lists = %I64d\n", t, n, m, f[n][m]);
}
return 0;
}