Want help for Optimal Binary Search Tree

[khipro]

Here i have coded algorithm for Optimal Binary Search Tree but not getting correct result can anybody help me (it is executing but result is not desired)?

#include<iostream>
using std::cin;
using std::cout;
using std::endl;
 
#include<iomanip>
using std::setw;
 
 
const int n=4;
int R[n+1][n];
const float p[n] = {0.1,0.4,0.2,0.3};
 
 
    float sump(int i, int j );
    void optsearchtree(float &minavg);
    int main (int argc, char *argv[])
         { 
            char quit;  
            quit = '\0';
            while (quit != 'x')
              {
                float minavg;  
                optsearchtree(minavg);
                cout<<endl<<endl;  
                cout<<" Average time for Optimal Binary tree -> : "<<minavg<<endl;
                cout << endl << " Press x to quit "<<endl;
                cin >> quit;
              }
            return 0;
         }
 
void optsearchtree(float &minavg)                 
         {
            int i,j,k,diagonal;
            float temp;
            float A[n+1][n];
            for (i=1; i <= n; i++)   
             {
               A[i][i-1] = 0;
               A[i][i] = p[i];
               R[i][i] = i;
               R[i][i-1] = 0;       
              }                      
             A[n+1][n] = 0;  
             R[n+1][n] = 0;
             for(diagonal =1; diagonal <= n-1; diagonal++)
               for(i=1; i <= n - diagonal; i++)
                 {
                    j = i+ diagonal;
                    for(k = i; k <= j ; k++)
                          {
                            temp = A[i][k-1]+ A[k+1][j];      
                            if (temp < A[i][j])
                              {
                                A[i][j]=temp + sump(i,j);
                                R[i][j]=k;      
                              }   
                          }       
                  }      
              minavg = A[1][n];    
           }       
 
           float sump(int i, int j )
            {
               float sum = 0;
               for(int a=i; a <= j ; a++)
               sum = sum + p[a];
               return sum;  
            }     
 

[weaknessforcats]

What is your question exactly?

I don't have time to debug this code and hand you the results.