/* The third of three files illustrating dynamic programming.  This 
   one is iterative, working back from the final time to the present.  */

#include <iostream.h>

#define TMAX 26        /* The number of steps.  */
#define N 2*TMAX+1     /* The "x" size of the A array. */




int main() {

  float A[N][TMAX];
  
  int t, k, kindex;
  fo

  cout << "Here is a probability computed with memoized recursion... " << endl;
  cout << "   " <<  R( 0, 25, .6, A) << endl;
  cout << "How long did that take?" << endl;

}