1251.cpp

ZOJ 动态规划算法题目入门与提高 源代码

#include<cstdio>
#include<cmath>
using namespace std;
int data[50];
int main()
{
    //freopen("in.txt","r",stdin);
    int n;
    int line=0;
    while(scanf("%d\n",&n)&&n)
    {
        int sum=0;
        for(int i=0;i<n;i++)
        {    
             scanf("%d",&data[i]);
             sum+=data[i];
        }
        sum/=n;
        int move=0;
        for(int i=0;i<n;i++)
        {
             move+=abs(data[i]*1.0-sum*1.0);            
        }   
        move/=2;     
        printf("Set #%d\nThe minimum number of moves is %d.\n\n",++line,move);
    }
}