【算法练习】CSP--202112-2--序列查询新解

【70分思路】

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#define ll long long
using namespace std;

int n, N, error;

int main() {
	cin >> n >> N;
	vector<ll>A(n + 2, 0);
	A[n + 1] = N;

	for (size_t i = 1; i <= n; i++)
	{
		cin >> A[i];
	}

	// 计算 f(x)
	vector<ll>fx(N);
	for (size_t i = 0; i < n + 1; i++)
	{
		for (size_t j = A[i]; j < A[i + 1]; j++)
		{
			fx[j] = i;
		}
	}

	// 计算 g(x)
	ll r = N / (n + 1);
	vector<ll>gx(N);
	for (size_t i = 0; i < N; i++)
	{
		gx[i] = i / r;
	}

	// 计算 error
	for (size_t i = 0; i < N; i++)
	{
		error += abs(fx[i] - gx[i]);
	}

	cout << error;
	return 0;
}