hdu2014

#include <stdio.h>

int a[35];
int cal(int n)  //记忆化
{
    a[n] = 1;
    for(int i = n - 1; i >= 1; i--)
        a[i] = (a[i + 1] + 1) * 2;
}

int cal2(int n)  //递推
{
    if(n == 1)
        return 1;
    else
        return (cal2(n - 1) + 1)*2;
}
int main()
{
    int n;
    while(scanf("%d", &n) != EOF)
    {printf("%d\n", cal2(n));}
    return 0;
}

简单动态规划，由fibnacci数列得到启示

1. 递推
   $$f(n)=\{\begin{array}{ll}1,& \text{if n = 1}\\ [f(n-1)+1]\ast 2,& \text{if n > 1}\end{array}$$

2. 记忆化
   $$a[n]=\{\begin{array}{ll}1& \text{if n = 1}\\ (a[n-1]+1)\ast 2,& \text{if n > 1}\end{array}$$