[問題] 矩陣運算
遇到的問題: (題意請描述清楚)
矩陣運算耗費太久的時間
舉例說明:
EX1: ~矩陣運算~
int A[62][62][34];
for (int i=-90;i<=90;i++){
for (int j=-90;j<=90;j++){
for (int iii=1;iii<=61;iii++){
for (int jjj=1;jjj<=61;jjj++){
for (int kkk=1;kkk<=33;kkk++){
A[iii][jjj][kkk]=(iii+jjj)/kkk }}}}}
就需要10多秒~
======================================================================
EX2: ~矩陣累加~
int A[62][62][34];
int main(){
for (int i=-90;i<=90;i++){
for (int j=-90;j<=90;j++){
for (int iii=1;iii<=61;iii++) {
for (int jjj=1;jjj<=61;jjj++) {
for (int kkk=1;kkk<=33;kkk++) {
A[iii][jjj][kkk]=A[iii][jjj][kkk]+(iii+jjj)/kkk; }}}}}
則需20多秒~
是否有針對"矩陣運算" 及 "矩陣累加"進行時間改善的方法???
開發平台: (例: VC++ or gcc/g++ or Dev-C++, Windows or Linux)
VC++
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.114.58.91
推
10/05 12:37, , 1F
10/05 12:37, 1F
→
10/05 12:47, , 2F
10/05 12:47, 2F
→
10/05 12:49, , 3F
10/05 12:49, 3F
→
10/05 12:49, , 4F
10/05 12:49, 4F
→
10/05 12:49, , 5F
10/05 12:49, 5F
推
10/05 12:57, , 6F
10/05 12:57, 6F
→
10/05 13:10, , 7F
10/05 13:10, 7F
推
10/05 14:16, , 8F
10/05 14:16, 8F
推
10/06 00:56, , 9F
10/06 00:56, 9F
→
10/06 09:43, , 10F
10/06 09:43, 10F
→
10/07 13:52, , 11F
10/07 13:52, 11F
討論串 (同標題文章)