{"problem":{"name":"Negative Doubling","description":{"content":"There are $N$ positive integers $A_1, A_2, ..., A_N$. Takahashi can perform the following operation on these integers any number of times: *   Choose $1 \\leq i \\leq N$ and multiply the value of $A_i$","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"caddi2018_c"},"statements":[{"statement_type":"Markdown","content":"There are $N$ positive integers $A_1, A_2, ..., A_N$. Takahashi can perform the following operation on these integers any number of times:\n\n*   Choose $1 \\leq i \\leq N$ and multiply the value of $A_i$ by $-2$.\n\nNotice that he multiplies it by **minus** two.\nHe would like to make $A_1 \\leq A_2 \\leq ... \\leq A_N$ holds. Find the minimum number of operations required. If it is impossible, print `-1`.\n\n## Constraints\n\n*   $1 \\leq N \\leq 200000$\n*   $1 \\leq A_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"caddi2018_c","tags":[],"sample_group":[["4\n3 1 4 1","3\n\nOne possible solution is:\n\n*   Choose $i=4$ and multiply the value of $A_4$ by $-2$. $A_1, A_2, A_3, A_4$ are now $3, 1, 4, -2$.\n*   Choose $i=1$ and multiply the value of $A_1$ by $-2$. $A_1, A_2, A_3, A_4$ are now $-6, 1, 4, -2$.\n*   Choose $i=4$ and multiply the value of $A_4$ by $-2$. $A_1, A_2, A_3, A_4$ are now $-6, 1, 4, 4$."],["5\n1 2 3 4 5","0\n\n$A_1 \\leq A_2 \\leq ... \\leq A_N$ holds before any operation is performed."],["8\n657312726 129662684 181537270 324043958 468214806 916875077 825989291 319670097","7"]],"created_at":"2026-03-03 11:01:13"}}