# Jim and the Skyscrapers

### Problem Statement :

```Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently.

Let us describe the problem in one dimensional space. We have in total N skyscrapers aligned from left to right. The th skyscraper has a height of hi. A flying route can be described as ( i , j )  with i =/ j, which means, Jim starts his HZ42 at the top of the skyscraper i and lands on the skyscraper . Since HZ42 can only fly horizontally, Jim will remain at the height hi only. Thus the path ( i, j ) can be valid, only if each of the skyscrapers i, i + 1, . . ,  j - 1,  j  is not strictly greater than  and if the height of the skyscraper he starts from and arrives on have the same height. Formally, ( i , j ) is valid iff  and  hi = hj.

Help Jim in counting the number of valid paths represented by ordered pairs .

Input Format

The first line contains N, the number of skyscrapers. The next line contains N space separated integers representing the heights of the skyscrapers.

Output Format

Print an integer that denotes the number of valid routes.

Constraints

1   <=  N  <=  3 * 10^5 and no skyscraper will have height greater than 10^6 and less than 1.```

### Solution :

```                            ```Solution in C :

In C ++  :

#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

const int NMAX = 300010, CMAX = 1000010;

int N, V[NMAX], Right[NMAX];
stack<int> S;
vector<int> Val[CMAX];
long long Ans;

int main()
{
//  freopen("c.in", "r", stdin);
// freopen("c.out", "w", stdout);

scanf("%i", &N);
for(int i = 1; i <= N; ++ i)
{
scanf("%i", &V[i]);
Val[V[i]].push_back(i);
}

V[N + 1] = CMAX;

S.push(N + 1);
for(int i = N; i; -- i)
{
while(!S.empty() && V[S.top()] <= V[i]) S.pop();
Right[i] = S.top();
S.push(i);
}

for(int i = CMAX - 1; i >= 1; -- i)
{
int Ptr = 0;
for(int j = 0; j < Val[i].size(); )
{
while(Ptr < Val[i].size() && Val[i][Ptr] <= Right[ Val[i][j] ]) Ptr ++;
int Len = Ptr - j;
Ans += 1LL * Len * (Len - 1);
j = Ptr;
}
}

printf("%lld", Ans);
}

In Java :

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {

Scanner in=new Scanner(System.in);
int n=in.nextInt();
TreeMap<Integer,Integer> T=new TreeMap<Integer,Integer>();
long output=0L;
for (int i=0;i<n;i++){
int val=in.nextInt();
//add this new val to T
if (T.get(val)==null){T.put(val,1);}
else {
int num=T.get(val);
T.put(val,num+1);
}
//kill old values smaller than this new val
while (T.lowerKey(val)!=null){
int k=T.lowerKey(val);
int thisNum=T.get(k);
output+=thisNum*(thisNum-1);
//remove
T.remove(k);
}
}
//finisher
for (int k:T.keySet()){
long thisNum=(long)T.get(k);
output+=thisNum*(thisNum-1);

}

System.out.println(output);

}
}

In C :

#include<stdio.h>
int main()
{
int n,t,i,j,a,b,c;//change
long long d;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=1000000;i++)
{
c[i]=0;
}
t=0;
d=0;
b=a;
c[a]=1;
for(i=1;i<n;i++)
{
if(a[i]>b[t])
{
while(a[i]>b[t]&&t>=0)
{
c[b[t]]=0;
t--;
}
t++;
b[t]=a[i];
c[a[i]]++;
}
else
{
t++;
b[t]=a[i];
c[a[i]]++;
}
if(c[a[i]]!=0)
{
d+=c[a[i]]-1;
}
}
printf("%lld",2*d);
return 0;
}

In Python3 :

N = int(input())
h = [int(i) for i in input().split()]

count = 0

s = []
for i in range(0,N):
while len(s) > 0 and s[-1] < h[i]:
s.pop()
if len(s) > 0 and s[-1] == h[i]:
count += s[-1]
s[-1] += 1
else:
s.append([h[i],1])

print(2*count)```
```

## View More Similar Problems

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

## Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

## Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

## Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

## Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

## Largest Rectangle

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