zoj1276Optimal Array Multiplication Sequence 动态规划
来源:互联网 发布:笔记本音效增强软件 编辑:程序博客网 时间:2024/06/01 07:56
Given two arrays A and B, we can determine the array C = A B using the standard definition of matrix multiplication:
The number of columns in the A array must be the same as the number of rows in the B array. Notationally, let's say that rows(A) and columns(A) are the number of rows and columns, respectively, in the A array. The number of individual multiplications required to compute the entire C array (which will have the same number of rows as A and the same number of columns as B) is then rows(A) columns(B) columns(A). For example, if A is a 10 x 20 array, and B is a 20 x 15 array, it will take 10 x 15 x 20, or 3000 multiplications to compute the C array.
To perform multiplication of more than two arrays we have a choice of how to proceed. For example, if X, Y, and Z are arrays, then to compute X Y Z we could either compute (X Y) Z or X (Y Z). Suppose X is a 5 x 10 array, Y is a 10 x 20 array, and Z is a 20 x 35 array. Let's look at the number of multiplications required to compute the product using the two different sequences:
(X Y) Z
5 x 20 x 10 = 1000 multiplications to determine the product (X Y), a 5 x 20 array.
Then 5 x 35 x 20 = 3500 multiplications to determine the final result.
Total multiplications: 4500.
X (Y Z)
10 x 35 x 20 = 7000 multiplications to determine the product (Y Z), a 10 x 35 array.
Then 5 x 35 x 10 = 1750 multiplications to determine the final result.
Total multiplications: 8750.
Clearly we'll be able to compute (X Y) Z using fewer individual multiplications.
Given the size of each array in a sequence of arrays to be multiplied, you are to determine an optimal computational sequence. Optimality, for this problem, is relative to the number of individual multiplcations required.
Input
For each array in the multiple sequences of arrays to be multiplied you will be given only the dimensions of the array. Each sequence will consist of an integer N which indicates the number of arrays to be multiplied, and then N pairs of integers, each pair giving the number of rows and columns in an array; the order in which the dimensions are given is the same as the order in which the arrays are to be multiplied. A value of zero for N indicates the end of the input. N will be no larger than 10.
Output
Assume the arrays are named A1, A2, ..., AN. Your output for each input case is to be a line containing a parenthesized expression clearly indicating the order in which the arrays are to be multiplied. Prefix the output for each case with the case number (they are sequentially numbered, starting with 1). Your output should strongly resemble that shown in the samples shown below. If, by chance, there are multiple correct sequences, any of these will be accepted as a valid answer.
Sample Input
3
1 5
5 20
20 1
3
5 10
10 20
20 35
6
30 35
35 15
15 5
5 10
10 20
20 25
0
Sample Output
Case 1: (A1 x (A2 x A3))
Case 2: ((A1 x A2) x A3)
Case 3: ((A1 x (A2 x A3)) x ((A4 x A5) x A6))
import java.io.BufferedInputStream;import java.io.PrintWriter;import java.util.Scanner;public class Main {public static void main(String[] args) {new Task().solve();}}class Task {Scanner in = new Scanner(new BufferedInputStream(System.in)) ;PrintWriter out = new PrintWriter(System.out);int[] p ;int[][] dp ;int[][] father ;void dfs(int l , int r){if(l == r){out.print("A" + l) ;return ;}int f = father[l][r] ;out.print("(");dfs(l, f);out.print(" x ");dfs(f+1, r);out.print(")");}void solve() {int cas = 1 ;while(true){int n = in.nextInt() ; if(n == 0){ break ; } p = new int[n+1] ; dp = new int[n+2][n+2] ; father = new int[n+1][n+1] ; for(int i = 1 ; i <= n ; i++){ p[i-1] = in.nextInt() ; p[i] = in.nextInt() ; } for(int i = 1 ; i <= n+1 ; i++){ dp[i][i] = 0 ; } for(int d = 2 ; d <= n ; d++){ for(int i = 1 ; i + d - 1 <= n ; i++){ int j = i + d - 1 ; dp[i][j] = Integer.MAX_VALUE ; for(int k = i ; k <= j ; k++){ int sum = dp[i][k] + dp[k+1][j] + p[i-1] * p[k] * p[j] ; if(sum < dp[i][j]){ dp[i][j] = sum ; father[i][j] = k ; } } } } out.print("Case " + cas++ + ": ") ; dfs(1, n); out.println() ; out.flush();}out.flush(); }}
- zoj1276Optimal Array Multiplication Sequence 动态规划
- [动态规划]UVA348 - Optimal Array Multiplication Sequence
- uva_348Optimal Array Multiplication Sequence
- 348 - Optimal Array Multiplication Sequence
- 348 - Optimal Array Multiplication Sequence
- uva348 - Optimal Array Multiplication Sequence
- uva348 Optimal Array Multiplication Sequence
- Optimal Array Multiplication Sequence UVA
- Multiplication Puzzle--动态规划
- uva 348 Optimal Array Multiplication Sequence
- UVa 348. Optimal Array Multiplication Sequence
- uva:348 - Optimal Array Multiplication Sequence
- uva 348 Optimal Array Multiplication Sequence
- UVA 348 Optimal Array Multiplication Sequence
- UVa 348 - Optimal Array Multiplication Sequence
- uva 348 - Optimal Array Multiplication Sequence
- UVa 348 - Optimal Array Multiplication Sequence
- UVa 348 - Optimal Array Multiplication Sequence
- 解决Error:Execution failed for task ':app:transformClassesWithJarMergingForDebug'问题
- Time Profiler(时间分析器)--初识篇
- HTML/CSS学习记录(5)
- hdu4725The Shortest Path in Nya Graph(拆点 + 最短路dijkstra)
- PHP开发微信自定义菜单40033不转义中文的方法
- zoj1276Optimal Array Multiplication Sequence 动态规划
- Laravel5.3初步使用二(整体步骤、路由配置、Model层配置)
- imx6dl 关闭屏幕休眠
- 【网络】UDP服务器的实现
- STM32——USB详细使用说明 附件HID的双向通信
- 【Spring】
- 物料价值差异过账科目示例(PRD)
- c++输出数组方式
- Hibernate映射——多对一单向关联映射(四)