{"problem":{"name":"ABS Permutation (LIS ver.)","description":{"content":"The **happiness** of a permutation $P=(P_1,P_2,\\ldots,P_N)$ of $(1,\\dots,N)$ is defined as follows. *   Let $A=(A_1,A_2,\\ldots,A_{N-1})$ be a sequence of length $N-1$ with $A_i = |P_i-P_{i+1}|(1\\leq ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc140_c"},"statements":[{"statement_type":"Markdown","content":"The **happiness** of a permutation $P=(P_1,P_2,\\ldots,P_N)$ of $(1,\\dots,N)$ is defined as follows.\n\n*   Let $A=(A_1,A_2,\\ldots,A_{N-1})$ be a sequence of length $N-1$ with $A_i = |P_i-P_{i+1}|(1\\leq i \\leq N-1)$. The happiness of $P$ is the length of a longest strictly increasing subsequence of $A$.\n\nPrint a permutation $P$ such that $P_1 = X$ with the greatest happiness.\n\n## Constraints\n\n*   $2 \\leq N \\leq 2\\times 10^5$\n*   $1 \\leq X \\leq N$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $X$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc140_c","tags":[],"sample_group":[["3 2","2 1 3\n\nSince $A=(1,2)$, the happiness of $P$ is $2$, which is the greatest happiness achievable, so the output meets the requirement."],["3 1","1 2 3\n\nSince $A=(1,1)$, the happiness of $P$ is $1$, which is the greatest happiness achievable, so the output meets the requirement."]],"created_at":"2026-03-03 11:01:13"}}