Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
A
algorithm
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
문명균
algorithm
Commits
08cc75f0
Commit
08cc75f0
authored
Nov 15, 2020
by
문명균
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
add Matrixchain
parent
40ee66ce
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
53 additions
and
0 deletions
+53
-0
Matrixchain.cpp
Matrixchain.cpp
+53
-0
No files found.
Matrixchain.cpp
0 → 100644
View file @
08cc75f0
#include <stdio.h>
#include <math.h>
void
printing
(
int
s
[][
101
],
int
i
,
int
j
){
if
(
i
==
j
){
printf
(
"%d "
,
i
);
}
else
{
printf
(
"( "
);
printing
(
s
,
i
,
s
[
i
][
j
]);
printing
(
s
,
s
[
i
][
j
]
+
1
,
j
);
printf
(
") "
);
}
}
int
main
(){
//2019017410_Moon MyeongKyun_12838
int
N
,
j
,
q
;
int
p
[
102
];
int
m
[
101
][
101
],
s
[
101
][
101
];
scanf
(
"%d"
,
&
N
);
for
(
int
i
=
1
;
i
<=
N
+
1
;
i
++
){
scanf
(
"%d"
,
&
p
[
i
]);
}
for
(
int
i
=
1
;
i
<=
N
;
i
++
){
m
[
i
][
i
]
=
0
;
}
for
(
int
l
=
2
;
l
<=
N
;
l
++
){
for
(
int
i
=
1
;
i
<=
N
-
l
+
1
;
i
++
){
j
=
i
+
l
-
1
;
m
[
i
][
j
]
=
INFINITY
;
for
(
int
k
=
i
;
k
<=
j
-
1
;
k
++
){
q
=
m
[
i
][
k
]
+
m
[
k
+
1
][
j
]
+
p
[
i
]
*
p
[
k
+
1
]
*
p
[
j
+
1
];
if
(
q
<
m
[
i
][
j
]){
m
[
i
][
j
]
=
q
;
s
[
i
][
j
]
=
k
;
}
}
}
}
printf
(
"%d
\n
"
,
m
[
1
][
N
]);
printing
(
s
,
1
,
N
);
return
0
;
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment