算法1 记忆化

include [HTML_REMOVED]

using namespace std;
long long f[100];
int n;
long long jump(int n)
{
long long p;
if(f[n]!=-1) return f[n];
p=jump(n-1)+jump(n-2);
f[n]=p;
return p;
}
int main()
{
cin>>n;
memset(f,-1,sizeof f);
f[1]=f[2]=1;
cout<<jump(n+1)<<endl;
return 0;
}