{"problem":{"name":"Equal Cut","description":{"content":"Snuke has an integer sequence $A$ of length $N$. He will make three cuts in $A$ and divide it into four (non-empty) contiguous subsequences $B, C, D$ and $E$. The positions of the cuts can be freely c","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc100_b"},"statements":[{"statement_type":"Markdown","content":"Snuke has an integer sequence $A$ of length $N$.\nHe will make three cuts in $A$ and divide it into four (non-empty) contiguous subsequences $B, C, D$ and $E$. The positions of the cuts can be freely chosen.\nLet $P,Q,R,S$ be the sums of the elements in $B,C,D,E$, respectively. Snuke is happier when the absolute difference of the maximum and the minimum among $P,Q,R,S$ is smaller. Find the minimum possible absolute difference of the maximum and the minimum among $P,Q,R,S$.\n\n## Constraints\n\n*   $4 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n*   All values in input are integers.\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":"arc100_b","tags":[],"sample_group":[["5\n3 2 4 1 2","2\n\nIf we divide $A$ as $B,C,D,E=(3),(2),(4),(1,2)$, then $P=3,Q=2,R=4,S=1+2=3$. Here, the maximum and the minimum among $P,Q,R,S$ are $4$ and $2$, with the absolute difference of $2$. We cannot make the absolute difference of the maximum and the minimum less than $2$, so the answer is $2$."],["10\n10 71 84 33 6 47 23 25 52 64","36"],["7\n1 2 3 1000000000 4 5 6","999999994"]],"created_at":"2026-03-03 11:01:13"}}