Daily Temperatures (Monotonic Stack)

t[i] is the temperature on day i. For every day, how many days do you have to wait for a warmer temperature? Print 0 if no warmer day comes.

Input:

• line 1: n
• line 2: n temperatures

Output: n numbers on one line.

Constraints: 1 ≤ n ≤ 10⁵, 30 ≤ t[i] ≤ 100.

Think about it: keep a stack of days that are still waiting for a warmer day; their temperatures are decreasing from bottom to top. When a warmer day arrives, it answers every colder day on top of the stack. Each day is pushed and popped once — O(n).