题目链接点击打开链接
题意按公式求A(m,n)的值;
我开始用DP,结果wa了,后面看别人的找规律,这难道不是和DP一样的吗,而且d3的n<=25,都不会超Int,好气
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int d[4][1000002];
void init()
{
int i;
d[0][0]=1;d[1][0]=2;d[2][0]=3;d[3][0]=5;
for(i=1;i<=1000000;i++)d[0][i]=d[0][i-1]+1;
for(i=1;i<=1000000;i++)d[1][i]=d[1][i-1]+1;
for(i=1;i<=1000000;i++)d[2][i]=d[2][i-1]+2;
for(i=1;i<=26;i++)d[3][i]=2*d[3][i-1]+3;
}
int main()
{
int n,m;
init();
while(~scanf("%d %d",&m,&n))
{
printf("%d\n",d[m][n]);
}
return 0;
}
wa的代码:
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1e6+10;
const int INF=0x3f3f3f3f;
int d[4][maxn];
int A(int m,int n)
{
if(d[m][n])return d[m][n];
if(m==0)return n+1;
if(m>0&&n==0)
{
if(d[m-1][1])return d[m-1][1];
else return A(m-1,1);
}
if(m>0&&n>0)
{
if(d[m][n-1])
{
if(d[m-1],d[m][n-1])return d[m-1][d[m][n-1]];
else return A(m-1,d[m][n-1]);
}
return A(m-1,A(m,n-1));
}
}
int main()
{
int n,m;
memset(d,0,sizeof(d));
for(int i=0;i<3;i++)
for(int j=0;j<=1000000;j++)
d[i][j]=A(i,j);
for(int i=0;i<=25;i++)d[3][i]=A(3,i);
while(~scanf("%d %d",&m,&n))
{
printf("%d\n",d[m][n]);
}
return 0;
}