柱状图中最大的矩形

/*
84. 柱状图中最大的矩形
给定 n 个非负整数，用来表示柱状图中各个柱子的高度。每个柱子彼此相邻，且宽度为 1 。

求在该柱状图中，能够勾勒出来的矩形的最大面积。

 

示例 1:



输入：heights = [2,1,5,6,2,3]
输出：10
解释：最大的矩形为图中红色区域，面积为 10
示例 2：



输入： heights = [2,4]
输出： 4
 

提示：

1 <= heights.length <=10 ^ 5
0 <= heights[i] <= 10 ^ 4
*/


#include <stdio.h>
#include <stdlib.h>
#include <string.h>

static void calc_rects(int start, int end, int *heights, int *rect)
{
	int i, next_s = 0;

	for (i = start + 1; i <= end; i++) {
		//mark a larger num
		if (heights[i] > heights[start]) {
			if (next_s == 0) {
				next_s = i;
			}
		} else if (heights[i] < heights[start]) {
			//if smaller than start, it's end to calc one loop
			rect[i] += heights[i] * (i - start + rect[start]/heights[start]);
			rect[start] += heights[start] * (i - start - 1);
		
			if (next_s > 0) {
				rect[next_s] = heights[next_s];
				calc_rects(next_s, i-1, heights, rect);
			}
			// to next loop from small to large 
			next_s = 0;
			start = i;
		}
	}

	if (start < end) {
		rect[start] += heights[start] * (i - start - 1);
		if (next_s > 0) {
			rect[next_s] = heights[next_s];
			calc_rects(next_s, end, heights, rect);
		}
	}
}

int largestRectangleArea(int* heights, int heightsSize)
{
	int *rect = (int *)malloc(heightsSize * sizeof(int));
	int max;

	memset(rect, 0, heightsSize * sizeof(int));

	rect[0] = heights[0];
	calc_rects(0, heightsSize - 1, heights, rect);

	max = rect[0];

	for (int i = 1; i < heightsSize; i++) {
		if (rect[i] > max) {
			max = rect[i];
		}
	}

	free(rect);
	return max;
}

int main(int argc, char *argv[])
{
	if (argc < 2) {
		printf("please input a serial nums > 0!\n");
		return 0;
	}

	int size = argc - 1;
	int *nums = (int *)malloc(size * sizeof(int));

	for (int i = 1; i <= size; i++) {
		nums[i - 1] = atoi(argv[i]);
	}

	printf("%d\n", largestRectangleArea(nums, size));

	free(nums);

	return 0;
}