幸运序列（整体处理+中位数定理）

解题思路：

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
#include<math.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
int n;
int a[maxn];
ll ans[maxn];
priority_queue<int,vector<int>, greater<int> > big;
priority_queue<int> small;
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		a[i] -= i-1;
		ans[i] = 1e9;
	}
	if (n == 1) {
		cout << 0 << endl;
		return 0;
	}
	ll sum1=0, sum2 = 0;
	ans[1] = 0;
	ans[2] = abs(a[2] - a[1]);
	big.push(max(a[2], a[1]));
	small.push(min(a[2], a[1]));
	sum1 += min(a[2], a[1]);
	sum2 += max(a[2], a[1]);
	for (int i = 3; i <= n; i++) {
	//为偶数时，两个数都要进入队列中
	//结果形式为A[n]+A[n-1]+....+A[n/2+1]-A[n/2-1]-...-A[1]
		if (i % 2 == 0) {
			int tmp1 = max(a[i], a[i - 1]);
			int tmp2 = min(a[i], a[i - 1]);
			big.push(tmp1);
			small.push(tmp2);
			sum1 += tmp2;
			sum2 += tmp1;
		}
		else {
		//处理到奇数个数时
		//结果形式为 A[n]+A[n-1]+....+A[n/2+2]-A[n/2]-...-A[1]
		//A[(n+1)/2]当做中位数不需要处理
			if (a[i] < small.top()) {
				sum1 -= small.top();
				sum1 += a[i];
				int tmp = a[i];
				a[i] = small.top();
				small.pop();
				small.push(tmp);
			}
			else if (a[i] > big.top()) {
				sum2 -= big.top();
				sum2 += a[i];
				int tmp = a[i];
				a[i] = big.top();
				big.pop();
				big.push(tmp);
			}
		}
		ans[i] = (sum2 - sum1)%mod;

	}
	for (int i = 1; i <= n; i++) {
		printf("%lld", ans[i]%mod);
		if (i == n)
			printf("\n");
		else
			printf(" ");
	}
	return 0;
}