Wine trading in Gergovia uva+贪心

Wine trading in Gergovia

As you may know from the comic "Asterix and the Chieftain's Shield", Gergovia consists of one street, and every inhabitant of the city is a wine salesman. You wonder how this economy works? Simple enough: everyone buys wine from other inhabitants of the city. Every day each inhabitant decides how much wine he wants to buy or sell. Interestingly, demand and supply is always the same, so that each inhabitant gets what he wants.

There is one problem, however: Transporting wine from one house to another results in work. Since all wines are equally good, the inhabitants of Gergovia don't care which persons they are doing trade with, they are only interested in selling or buying a specific amount of wine. They are clever enough to figure out a way of trading so that the overall amount of work needed for transports is minimized.

In this problem you are asked to reconstruct the trading during one day in Gergovia. For simplicity we will assume that the houses are built along a straight line with equal distance between adjacent houses. Transporting one bottle of wine from one house to an adjacent house results in one unit of work.

Input Specification

The input consists of several test cases. Each test case starts with the number of inhabitants n (2 ≤ n ≤ 100000). The following line contains n integers a_i (-1000 ≤ a_i ≤ 1000). If a_i ≥ 0, it means that the inhabitant living in the i^th house wants to buy a_i bottles of wine, otherwise if a_i < 0, he wants to sell -a_ibottles of wine. You may assume that the numbers a_i sum up to 0.
The last test case is followed by a line containing 0.

Output Specification

For each test case print the minimum amount of work units needed so that every inhabitant has his demand fulfilled. You may assume that this number fits into a signed 64-bit integer (in C/C++ you can use the data type "long long", in JAVA the data type "long").

Sample Input

5
5 -4 1 -3 1
6
-1000 -1000 -1000 1000 1000 1000
0

Sample Output

9
9000

解决方案：可先把最左边的问题解决了，让其归0，依次寻找左边第一个不为0的，将其解决。这个方法速度超级慢，有一个更快的方法，这里就不说了，人家的飞机速度，我的步行。

代码：
#include<iostream>
#include<cstdio>
#define MMAX 100003
using namespace std;
int num[MMAX];
int n;
int main(){

    while(~scanf("%d",&n)&&n){
      for(int i=0;i<n;i++){
        scanf("%d",&num[i]);
       }
       long long sum=0;
      for(int i=0;i<n;i++){
        if(num[i]>0){
            for(int j=i+1;j<n;j++){
             if(num[j]<0){
                if(num[i]+num[j]>0){
                    sum+=(i-j)*num[j];
                    num[i]+=num[j];
                    num[j]=0;


                }
                else {
                    num[j]+=num[i];
                    sum+=(j-i)*num[i];
                    num[i]=0;break;
                }
             }
            }
        }
        else if(num[i]<0){
            for(int j=i+1;j<n;j++){
                if(num[j]>0){
                if(num[i]+num[j]>0){
                    sum+=(i-j)*num[i];
                    num[j]+=num[i];
                    num[i]=0;
                    break;

                }
                else {
                    num[i]+=num[j];
                    sum+=(j-i)*num[j];
                    num[j]=0;
                }
             }

            }

        }
      }
      cout<<sum<<endl;
    }






    return 0;}