<div>int minmult(int n, const int d[], int P([][])){</div> <div><br></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>int i, j, k, diagonal;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>int **M;</div> <div><br></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>M = (int**)malloc(sizeof(int*) * n);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>for (int i = 0; i<n; i++) {</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>M[i] = (int*)malloc(sizeof(int) * n);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><br></div> <div><br></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>for (i = 1; i <= n; i++)</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>M[i][i] = 0;<span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>for(diagonal=1; diagonal<=n-1; diagonal++)</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>for (i = 1; i <= n - diagonal; i++) {</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>j = i + diagonal;</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>for(k=i; k<=j-1; k++){</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>M[i][j] = minimum(M[i][k] + M[k + 1][j] + d[i - 1] * d[k] * d[j]);</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>P[i][j] = k; <span style="background-color:#ffff00;"> // 식이 완전한 개체형식에 대한 포인터여야 한다고 뜹니다ㅠㅠ</span></div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>}</div> <div><span class="Apple-tab-span" style="white-space:pre;"> </span>return M[1][n];</div> <div>}</div> <div><br></div> <div>간만에 하려니 기초도 다 까먹었나 봐요 다시 공부하려니까 어렵네요ㅠ</div> <div>문제가 무엇인지 알려주세요ㅠㅠ</div>
댓글 분란 또는 분쟁 때문에 전체 댓글이 블라인드 처리되었습니다.