C++递归法算矩阵连乘问题

#include<iostream>
using namespace std;

int fun(int i,int j,int m[]) {
if(i==j) return 0;
int min = 10000000;
int k;
for(k=i;k<j;k++) {
int temp = fun(i,k,m) + fun(k+1,j,m) + m[i-1] * m[k] * m[j];
if(temp<min) min=temp;
}
return min;
}

int main() {
int n[] = {50,10,40,30,5 };
cout<<fun(1,4,n)<<endl;
return 0;
}