2942167_ac_0ms_72k.cpp

来自「北大大牛代码 1240道题的原代码 超级权威」· C++ 代码 · 共 55 行

#include <stdio.h>
#include <math.h>

void swap(int &a,int &b)
{
	a += b;
	b = a - b;
	a = a - b;
}

int mid(int a,int b,int c)
{
	if(a > b)
		swap(a,b);
	if(a > c)
		swap(a,c);
	if(b > c)
		swap(b,c);
	return b;
}

int main()
{
	int i, flag, n;
	int b[101], a[101];

	scanf("%d",&n);
	for(i = 0; i < n; i++)
	{
		scanf("%d",&a[i]);
		b[i] = a[i];
	}
	flag = 1;
	while(flag)
	{
		flag = 0;
		for(i = 1; i < n-1; i++)
		{
			if(b[i]!=mid(b[i-1],a[i],b[i+1]))
			{
				flag = 1;
				b[i] = mid(b[i-1],a[i],b[i+1]);
			}
		}
	}
	int ans = 0;
	for(i = 0; i < n; i++)
	{
		ans += abs(a[i]-b[i]);
		if(i)
			ans += abs(b[i]-b[i-1]);
	}
	printf("%d\n",ans);
	return 0;
}