POJ 2313 中位元的應用

我發誓再也不看Discuss了~~

#include<stdio.h>#include<algorithm>#include<cmath>using namespace std;int A[101];int B[101];int Mid( int a,int b,int c ){    int num[4];    num[0]=a;    num[1]=b;    num[2]=c;    sort(num,num+3);    return num[1];}int main(){    int n;    while( scanf( "%d",&n )!=EOF )    {           int i,j;           for( i=0;i<n;i++ )           {                     scanf( "%d",&A[i] );                B[i]=A[i];           }           int sum=0;           for( i=1;i<n-1;i++ )                    B[i]=Mid( B[i-1],A[i],A[i+1] );           for( i=0;i<n;i++ )                sum+=abs( A[i]-B[i] );           for( i=0;i<n-1;i++ )                sum+=abs( B[i]-B[i+1] );           printf( "%d\n",sum );    }    return 0;}