算法笔记_动态规划：斐波那契

题目链接：http://codeup.cn/problem.php?cid=100000625&pid=0

题目描述
The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55…} are defined by the recurrence:
F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2
Write a program to calculate the Fibonacci Numbers.

输入
Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。

输出
For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.

样例输入
1
样例输出
1

#include <iostream>
#include <cstring>
using namespace std;
const int MAXN = 32;
int dp[MAXN];

int F(int x){
    if (x == 0) return 0;
    if (x == 1) return 1;
    if (dp[x] != -1) return dp[x];
    else {
        dp[x] = F(x-1) + F(x-2);
        return dp[x];
    }
}
int main(){
    int n;
    while (cin >> n){
        memset(dp, -1, sizeof(dp));
        cout << F(n) << endl;
    }
    return 0;
}