**Largest Rectangle**

### Problem Statement :

Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle of area . For example, the heights array . A rectangle of height and length can be constructed within the boundaries. The area formed is . Function Description Complete the function largestRectangle int the editor below. It should return an integer representing the largest rectangle that can be formed within the bounds of consecutive buildings. largestRectangle has the following parameter(s): h: an array of integers representing building heights Input Format The first line contains n, the number of buildings. The second line contains n space-separated integers, each representing the height of a building. Output Format Print a long integer representing the maximum area of rectangle formed.

### Solution :

` ````
Solution in C :
In C ++ :
#include <stack>
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N, h[100005];
int p = 1, s[100005];
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) scanf("%d", &h[i]);
int ans = 0;
for (int i = 0; i < N + 2; ++i) {
while (h[i] < h[s[p - 1]]) {
int y = h[s[p - 1]];
p--;
ans = max(ans, (i - s[p - 1] - 1) * y);
}
s[p++] = i;
}
printf("%d\n", ans);
return 0;
}
In Java :
import java.io.*;
import java.util.*;
public class Solution {
static boolean[] valid;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] ar = new long[n];
for(int i=0; i<n; i++)
ar[i] = sc.nextInt();
int[] left = new int[n];
int[] right = new int[n];
Arrays.fill(left, -1); Arrays.fill(right, -1);
Stack<Integer> st = new Stack<Integer>();
for(int i=0; i<n; i++){
while(st.size() > 0){
if(ar[st.peek()] < ar[i]){
left[i] = st.peek();
break;
}
else
st.pop();
}
st.push(i);
}
st.clear();
for(int i=n-1; i>=0; i--){
while(st.size() > 0){
if(ar[st.peek()] < ar[i]){
right[i] = st.peek();
break;
}
else
st.pop();
}
st.push(i);
}
// pArray(left);
// pArray(right);
long max = Integer.MIN_VALUE;
for(int i=0; i<n; i++){
long ans = 0;
if(left[i] >= 0)
ans+=ar[i]*(i - left[i] -1);
else
ans += ar[i] * i;
if(right[i] > -1)
ans+=ar[i]*(right[i] - i -1);
else
ans += ar[i] * (n - i-1);
ans += ar[i];
if(ans > max)
max = ans;
//System.out.println(ans);
}
System.out.println(max);
}
static void pArray(int[] ar){
for(int i=0; i<ar.length; i++)
System.out.print(ar[i] + " ");
System.out.println();
}
}
In C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int i, j, k, n, h;
int ar[100000];
int area, max=0;
scanf("%d",&n);
for(i=0;i<=n;++i)
scanf("%d",&ar[i]);
for(i=0;i<=n;++i)
{
int c = 1;
j = i-1;
k = i+1;
while(j>=0 && ar[j]>ar[i]){
j--;
c++;
}
while(k<=n && ar[k]>ar[i]){
k++;
c++;
}
area = c * ar[i];
max = (area>max)? area : max;
}
printf("%d",max);
return 0;
}
In Python3 :
def solve(H) :
s,i,m = [],0,0
while i < len(H) :
if not s or H[i] > H[s[-1]] :
s.append(i)
i += 1
else :
t = s.pop()
a = H[t] * ((i - s[-1] -1) if s else i)
if a > m :
m = a
while s :
t = s.pop()
a = H[t] * ((i - s[-1] -1) if s else i)
if a > m :
m = a
return m
N = int(input())
H = list(int(_) for _ in input().split())
print(solve(H))
```

## View More Similar Problems

## Super Maximum Cost Queries

Victoria has a tree, T , consisting of N nodes numbered from 1 to N. Each edge from node Ui to Vi in tree T has an integer weight, Wi. Let's define the cost, C, of a path from some node X to some other node Y as the maximum weight ( W ) for any edge in the unique path from node X to Y node . Victoria wants your help processing Q queries on tree T, where each query contains 2 integers, L and

View Solution →## Contacts

We're going to make our own Contacts application! The application must perform two types of operations: 1 . add name, where name is a string denoting a contact name. This must store name as a new contact in the application. find partial, where partial is a string denoting a partial name to search the application for. It must count the number of contacts starting partial with and print the co

View Solution →## No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

View Solution →## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

View Solution →## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

View Solution →## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →