CF 248 C. Ryouko's Memory Note

记录每个点相邻的点， 遍历所有的点，假设更新点是当前点的这些相邻点的中点（贪心）， 进行计算并更新结果。

#include<stdio.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;

#define N 100005
typedef long long LL;

vector<int> v[N];
int a[N];

int main()
{
	int n, m;
	while(~scanf("%d%d", &n, &m))
	{
		for(int i = 1; i <= n; i++)
		{
			v[i].clear();
		}
		LL all = 0;
		a[0] = 0;
		int p = 0;
		
		for(int i = 1; i <= m; i++)
		{
			scanf("%d", &a[i]);
			p = p > a[i] ? p : a[i];
		}
		
		for(int i = 2; i <= m; i++)
		{
			if(a[i] != a[i-1])
			{
				all += abs(a[i] - a[i-1]);
				v[a[i]].push_back(a[i-1]);
				v[a[i-1]].push_back(a[i]);
			}
		}
		LL ans = all;
		
		for(int i = 1; i <= p; i++)
		{
			LL t = all;
			int _size = v[i].size();  
	        if(_size == 0)  
	            continue; 
         	sort(v[i].begin(), v[i].end());
         	int mid = v[i][_size / 2];
         	for(int j = 0; j < v[i].size(); j++)
         	{
	         	t += (abs(v[i][j] - mid) - abs(i - v[i][j]));
         	}
         	ans = min(ans, t);
		}
		__int64 res = ans;
		printf("%I64d\n", res);
	}
	return 0;
}