Scribd
Upload
152 views1 page

Long ATM Queue

A long queue has formed outside an ATM due to withdrawal limits during demonetization in India. People come in groups to withdraw money since there is a limit per person per day. Groups line up one after another in the queue. Each group arranges themselves in order of increasing height. A boy named Swapy wants to know the minimum number of groups in the queue but it is difficult to distinguish groups as they stand behind one another.

Uploaded by

Aiza Arcena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
152 views1 page

Long ATM Queue

A long queue has formed outside an ATM due to withdrawal limits during demonetization in India. People come in groups to withdraw money since there is a limit per person per day. Groups line up one after another in the queue. Each group arranges themselves in order of increasing height. A boy named Swapy wants to know the minimum number of groups in the queue but it is difficult to distinguish groups as they stand behind one another.

Uploaded by

Aiza Arcena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Long ATM Queue

Due to the demonetization move, there is a long queue of people in front of ATMs. Due to withdrawal
limit per person per day, people come in groups to withdraw money. Groups come one by one and
line up behind the already present queue. The groups have a strange way of arranging themselves.
In a particular group, the group members arrange themselves in increasing order of their height(not
necessarily strictly increasing).

Swapy observes a long queue standing in front of the ATM near his house. Being a curious kid, he
wants to count the total number of groups present in the queue waiting to withdraw money. Since
groups are standing behind each other, one cannot differentiate between different groups and the
exact count cannot be given. Can you tell him the minimum number of groups that can be observed
in the queue?

Input format:
The first line of input contains one positive integer N. The second line contains N space-separated
integers H[i] denoting the height of i-th person. Each group has group members standing in
increasing order of their height.

Output format:
Print the minimum number of groups that are at least present in the queue?

Constraints:
 1≤N≤1,000,000
 1≤H[i]≤1,000,000
SAMPLE INPUT

4
1 2 3 4
SAMPLE OUTPUT

You might also like