算法：变形的最大矩阵面积

题目

在X轴上水平放置着 N 个条形图，这 N 个条形图就组成了一个柱状图，每个条形图都是一个矩形，求出这些矩阵所能包含的最大矩阵面积，例如x坐标为{1,1,1,1,2,1,1}，y坐标为{5,2,5,4,5,1,6}，则最大矩阵面积为（1+1+2）* 4 = 16

分析

以到第四个索引作为结尾来求此时的最大矩阵面积为例，此时的最大矩阵面积可以是（1+1+2）* 4或者（1+1+1+1+2）* 2或者是2 * 5，取他们中的最大值，有了这个想法，下面给出代码。

代码

package algorithm;
import java.util.*;

public class Main{
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] x = {1,1,1,1,2,1,1};
        int[] y = {5,2,5,4,5,1,6};
        printAnswer(x,y);
    }
    
    public static void printAnswer(int[] x,int[] y) {
    	int[] dp = new int[x.length];
    	for (int i = 0;i < dp.length;i++) {
    		int sumMax = 0; 
    		int high = y[i];
    		int indexI = i;
    		while(indexI >= 0) {
    			int sum = 0;
    			if (y[indexI] < high) {
    				for (int j = indexI+1;j <= i;j++) {
    					sum += x[j] * high;
    					if (sum > sumMax) {
    						sumMax = sum;
    					}
    				}
    				high = y[indexI];
    			} else if (indexI == 0) {
    				//找到了索引0都没有找到比high小的，那就从0开始算
    				for (int j = 0;j <= i;j++) {
    					sum += x[j] * high;
    					if (sum > sumMax) {
    						sumMax = sum;
    					}
    				}
    			}
    			indexI--;
    		}
    		dp[i] = sumMax;
    	}
    	int res = 0;
    	for (int  i = 0;i < dp.length;i++ ) {
    		if (res < dp[i]) {
    			res = dp[i];
    		}
    		System.out.println(dp[i]);
    	}
    	System.out.println(res);
    } 
}

如果用单调栈的思想来做也可以，我感觉也没变简单多少，下面给出代码：

单调栈求最大矩阵面积

    public static void printAnswer2(int[] x,int[] y){
    	//用单调栈的方法来做
    	Stack<Integer> stack = new Stack<Integer>();
    	int maxAera = 0;
    	for (int i = 0;i < x.length;i++) {
    		if (stack.isEmpty() || y[stack.peek()] < y[i]) {
    			System.out.println("入栈" + i);
    			stack.add(i);
    		} else {
    			// 如果出现比它小的，就一个个弹出,并计算形成的面积
    			while (!stack.isEmpty() && y[stack.peek()] > y[i]) {
    				
    				int indexHigh = i-1;
    				int height = stack.pop();
    				System.out.println("出栈" + height);
    				int aera = 0;
    				int indexLow = 0;
    				if (stack.isEmpty()) {
    					indexLow = 0;
    				} else {
    				
    				indexLow = stack.peek()+1;
    				}
    				for (int j = indexLow;j <= indexHigh;j++) {
    					aera += x[j] * y[height];
    				}
    				System.out.println("indexHigh = "+ indexHigh + ",aera= "+ aera);
    				maxAera = maxAera < aera ? aera : maxAera;
    			}
    			stack.add(i); 
    			System.out.println("入栈" + i);
    		}
    		
    		if (i == x.length-1) {
    			while (!stack.isEmpty()) {
    				int indexHigh = stack.pop();
    				int aera = 0;
    				int indexLow = 0;
    				if (stack.isEmpty()) {
    					indexLow = 0;
    				} else {
    				
    				indexLow = stack.peek()+1;
    				}
    				for (int j = indexLow;j <= indexHigh;j++) {
    					aera += x[j] * y[indexHigh];
    				}
    				System.out.println("indexHigh = "+ indexHigh + ",aera= "+ aera);
    				maxAera = maxAera < aera ? aera : maxAera;
    			}
    		}
    	}
    	System.out.println(maxAera); 
    }