Fibonacci with dynamic program in bottom up approach

gistfile1.txt

#include <iostream>

using namespace std;

long long dp[1000];

long long fib(int n){


    if(n==1 || n==2) return 1;

    if(dp[n]!=-1)  return dp[n];


    return dp[n]=fib(n-1)+fib(n-2);
}


int main()
{

    for(int i=0;i<1000;i++){
       dp[i]=-1;
    }
    int m;
    cin>>m;
    cout<<fib(m);
    return 0;
}