**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);
//add to output
int thisNum=T.get(k);
output+=thisNum*(thisNum-1);
//remove
T.remove(k);
}
}
//finisher
for (int k:T.keySet()){
//add to output
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[300001],b[300001],c[1000002];//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[0]=a[0];
c[a[0]]=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][0] < h[i]:
s.pop()
if len(s) > 0 and s[-1][0] == h[i]:
count += s[-1][1]
s[-1][1] += 1
else:
s.append([h[i],1])
print(2*count)
```

## View More Similar Problems

## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F

View Solution →## Binary Search Tree : Insertion

You are given a pointer to the root of a binary search tree and values to be inserted into the tree. Insert the values into their appropriate position in the binary search tree and return the root of the updated binary tree. You just have to complete the function. Input Format You are given a function, Node * insert (Node * root ,int data) { } Constraints No. of nodes in the tree <

View Solution →