Codeforces Global Round 5
D
Balanced Playlist
Codeforces
2000
原题
← C2E →
翻译中…

Your favorite music streaming platform has formed a perfectly balanced playlist exclusively for you. The playlist consists of $n$ tracks numbered from $1$ to $n$. The playlist is automatic and cyclic: whenever track $i$ finishes playing, track $i+1$ starts playing automatically; after track $n$ goes track $1$.

翻译中…

For each track $i$, you have estimated its coolness $a_i$. The higher $a_i$ is, the cooler track $i$ is.

翻译中…

Every morning, you choose a track. The playlist then starts playing from this track in its usual cyclic fashion. At any moment, you remember the maximum coolness $x$ of already played tracks. Once you hear that a track with coolness strictly less than $\frac{x}{2}$ (no rounding) starts playing, you turn off the music immediately to keep yourself in a good mood.

翻译中…

For each track $i$, find out how many tracks you will listen to before turning off the music if you start your morning with track $i$, or determine that you will never turn the music off. Note that if you listen to the same track several times, every time must be counted.

翻译中…

Input

翻译中…

The first line contains a single integer $n$ ($2 \le n \le 10^5$), denoting the number of tracks in the playlist.

翻译中…

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$), denoting coolnesses of the tracks.

翻译中…

Output

翻译中…

Output $n$ integers $c_1, c_2, \ldots, c_n$, where $c_i$ is either the number of tracks you will listen to if you start listening from track $i$ or $-1$ if you will be listening to music indefinitely.

翻译中…

Note

翻译中…

In the first example, here is what will happen if you start with...

翻译中…
  • track $1$: listen to track $1$, stop as $a_2 \lt \frac{a_1}{2}$.
  • track $2$: listen to track $2$, stop as $a_3 \lt \frac{a_2}{2}$.
  • track $3$: listen to track $3$, listen to track $4$, listen to track $1$, stop as $a_2 \lt \frac{\max(a_3, a_4, a_1)}{2}$.
  • track $4$: listen to track $4$, listen to track $1$, stop as $a_2 \lt \frac{\max(a_4, a_1)}{2}$.
翻译中…

In the second example, if you start with track $4$, you will listen to track $4$, listen to track $1$, listen to track $2$, listen to track $3$, listen to track $4$ again, listen to track $1$ again, and stop as $a_2 \lt \frac{max(a_4, a_1, a_2, a_3, a_4, a_1)}{2}$. Note that both track $1$ and track $4$ are counted twice towards the result.

翻译中…

样例

Input #1
4
11 5 2 7
Output #1
1 1 3 2
InputCopy OutputCopy
Input #2
4
3 2 5 3
Output #2
5 4 3 6
InputCopy OutputCopy
Input #3
3
4 3 6
Output #3
-1 -1 -1
InputCopy OutputCopy
题目信息
题号
1237D
时间限制
2 s
内存限制
512 MB
标签
二分
数据结构
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。