#include<iostream>
#include<vector>
using namespace std;
vector<int> A;
struct p {
int l, r, f; //值为f的序号左右端点l,r
};
vector<p>F;
int main() {
A.push_back(0);
int n, N,r;//n+1个数,最大值N
cin >> n >> N;
r = N / (n + 1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
A.push_back(a);
}
int temp = 1;
p b;
b.l = 0;
b.r = 1;
b.f = 0;
F.push_back(b);//最开始为0,下标【0,1)
for (int j = 1; j < N; j++) {//遍历从1到最大值的数
if (temp < A.size() && j < A[temp]) {
F[F.size() - 1].r++;//j小于数组中当前值时,右端点+1
}
else if (temp < A.size() && j == A[temp]) {//j等于当前值时,换到下一个值,更新区间
p c;
c.l = F[F.size() - 1].r;
c.r = c.l + 1;
c.f = temp;
F.push_back(c);
temp++;
}
else if (temp == A.size()) {//到数组中最后一个值之后,都在最后一个区间上加
F[F.size() - 1].r++;
}
}
long long sum = 0;
int k = 0;
for (int i = 0; i < N; i++) {
long int x = i / r;
if (i >= F[k].l && i < F[k].r) sum += abs(x - F[k].f);
else {
k++;
sum += abs(x - F[k].f);
}
}
cout << sum;
}
cff 202112-2序列查询新解(70分)
最新推荐文章于 2024-07-22 10:02:43 发布