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.


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]);

    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();

    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);
            //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);
        for (int k:T.keySet()){
            //add to output
            long thisNum=(long)T.get(k);

In C :

int main()
    int n,t,i,j,a[300001],b[300001],c[1000002];//change
    long long 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]:
    if len(s) > 0 and s[-1][0] == h[i]:
        count += s[-1][1]
        s[-1][1] += 1

View More Similar Problems

Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →

Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →

Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →

Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →

Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →

Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →