資源簡(jiǎn)介
矩陣連乘加括號(hào),使計(jì)算量最小。用vc++6.0可以運(yùn)行。
代碼片段和文件信息
#include????????????????//矩陣連乘問題
#define?N?7
void?traceback(int?s[][N]int?iint?j)
{
if(i==j)
{??cout<<“A“< else?if(i+1==j)
{??cout<<“(A“< else
{??cout<<“(“;
???traceback(sis[i][j]);
???traceback(ss[i][j]+1j);
???cout<<“)“;
???}
}
int?main()
{??int?p[N]={3035155102025};
???int?m[N][N]s[N][N];
???int?ijrkt;
???for(i=0;i ???m[i][i]=0
評(píng)論
共有 條評(píng)論