Gergovia's Wine Trading B805 (mobile Solitaire)

<span id="Label3"></p><p><p></p></p> <table style="width: 98%;" border="0" align="center"> <tbody> <tr> <td> Question description </td> </tr> <tr> <td> <p>   Line there are n equidistant villages, each of which buys wine or sells Liquor. The demand for wine in the first village is Ai ( -1000<=ai<=1000), of which ai>0 means to buy wine and ai<0 to sell Alcohol. The balance of supply and demand in all villages, i.e. all ai sum equals 0. Transporting k-units of wine from one village to the neighboring village requires a workforce of K units. Calculating at least how much labor is needed to meet the needs of all Villages. The output is guaranteed to be within the range of 64-bit signed Integers. </p> </td> </tr> <tr> <td> input </td> </tr> <tr> <td> Several sets of data, each set of two Rows. <br> for each set of data, the first row has an integer n, which indicates that there are N cellars, and the second row has n integers, from A1,a2 to An. The end of the <br> input ends with 0. </td> </tr> <tr> <td> output </td> </tr> <tr> <td> one row per group of data, an integer per line, representing the total Cost. </td> </tr> <tr> <td> Input Example </td> </tr> <tr> <td> <span class="bluebg">10 <br> 3 -1 -2 9 -4 -1& Nbsp;-7 9 -7 1 <br> 5 <br> 1000 -1000 1000 0 -1000 <br> 0 </span> </td> </tr> <tr> <td> Sample Output </td> </tr> <tr> <td> <span class="bluebg">33 <br> 2 <=&n </span> </td> </tr> <tr> <td> Other instructions </td> </tr> <tr> <td> data range: bsp;n <= 100 000 </td> </tr> <tr> <td>   </td> </tr> </tbody> </table><p><p>Approximate idea: push from the far left to the Right. Because the leftmost wine in a linear village must be transported to the Right. so, Add the absolute value of the current village, plus the current village (which can be negative), which is a simple algorithm. See Code for Details.</p></p><pre><span style="color: #008080;"><span style="color: #008080;">1</span></span>#include <iostream><span style="color: #008080;"><span style="color: #008080;">2</span></span>#include <cmath><span style="color: #008080;"><span style="color: #008080;">3</span></span>#include <cstring><span style="color: #008080;"><span style="color: #008080;">4</span></span>#include <cstdio><span style="color: #008080;"><span style="color: #008080;">5</span></span>#include <cstdlib><span style="color: #008080;"><span style="color: #008080;">6</span></span>#include <algorithm><span style="color: #008080;"><span style="color: #008080;">7</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">using</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">namespace</span></span><span style="color: #000000;"><span style="color: #000000;">std;</span></span><span style="color: #008080;"><span style="color: #008080;">8</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>a[<span style="color: #800080;"><span style="color: #800080;">1010101</span></span><span style="color: #000000;"><span style="color: #000000;">];</span></span><span style="color: #008080;"><span style="color: #008080;">9</span></span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">Main ()</span></span><span style="color: #008080;"><span style="color: #008080;">Ten</span></span> <span style="color: #000000;"><span style="color: #000000;">{</span></span><span style="color: #008080;"><span style="color: #008080;"></span> one</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span><span style="color: #000000;"><span style="color: #000000;">n;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> while</span>(cin>><span style="color: #000000;"><span style="color: #000000;">N)</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">if</span></span>(n==<span style="color: #800080;"><span style="color: #800080;">0</span></span>)<span style="color: #0000ff;"><span style="color: #0000ff;"></span> break</span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> the</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">1</span></span>; I<=n;i++) scanf (<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span>,&<span style="color: #000000;"><span style="color: #000000;">a[i]);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>m=a[<span style="color: #800080;"><span style="color: #800080;">1</span></span>],ans=<span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;"></span> for</span>(<span style="color: #0000ff;"><span style="color: #0000ff;">int</span></span>I=<span style="color: #800080;"><span style="color: #800080;">2</span></span>; i<=n;i++<span style="color: #000000;"><span style="color: #000000;">)</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #000000;"><span style="color: #000000;"> {</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span>ans+=<span style="color: #000000;"><span style="color: #000000;">ABS (m);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>m+=<span style="color: #000000;"><span style="color: #000000;">a[i];</span></span><span style="color: #008080;"><span style="color: #008080;"></span> +</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> a</span>printf<span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #800000;"><span style="color: #800000;">%d\n</span></span><span style="color: #800000;"><span style="color: #800000;">"</span></span><span style="color: #000000;"><span style="color: #000000;">, ans);</span></span><span style="color: #008080;"><span style="color: #008080;"></span> at</span> <span style="color: #000000;"><span style="color: #000000;"> }</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #008000;"><span style="color: #008000;">//</span></span><span style="color: #008000;"><span style="color: #008000;">system ("pause");</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span> <span style="color: #0000ff;"><span style="color: #0000ff;">return</span></span> <span style="color: #800080;"><span style="color: #800080;">0</span></span><span style="color: #000000;"><span style="color: #000000;">;</span></span><span style="color: #008080;"><span style="color: #008080;"></span> -</span>}</pre><span class="cnblogs_code_collapse"><span class="cnblogs_code_collapse">Gergovia's Wine Trade B805</span></span><p><p></p></p><p><p>Gergovia's Wine Trading B805 (mobile Solitaire)</p></p></span>