/* * Copyright (C) 2003-2008 Wang Pengcheng <wpc0000@gmail.com> * Permission is granted to copy, distribute and/or modify this * document under the terms of the GNU Free Documentation License, * Version 2.0 or any later version published by the Free Software Foundation; * with no Invariant Sections. * You may obtain a copy of the License at *   http://www.gnu.org/licenses/lgpl.txt *///19 Feb 2008package cn.edu.whu.iss.algorithm.unit15.matrixchain;public abstract class AbstractMatrixChain implements GetMatrixChainInfor {	protected long[] p;	protected int[][] s;	protected long ans;		public AbstractMatrixChain() {		super();	}	public AbstractMatrixChain(long[] p) {		super();		this.p = p;	}	public String getOptimalParens(long[] p) {		this.p = p;		return getOptimalParens();	}	public String getOptimalParens() {		matrixChainOrder();		return getOptimalParens(0, p.length-2);	}		private String getOptimalParens(int i,int j){		if(i==j){			return "A"+(i+1);		}else{			return "("+getOptimalParens(i, s[i][j])+getOptimalParens(s[i][j]+1, j)+")";		}	}	public long matrixChainOrder(long[] p) {		this.p = p;		ans = matrixChainOrder();		return ans;	}}