思路解析:
求最少操作次数其实就是在有解的前提下求a[i-1]-a[i]的最大值即可。当然数组长度为偶数的时候肯定有解,但奇数的时候可以通过本题的easy版本来判断。
代码如下:
#include<bits/stdc++.h>
using namespace std;
#define int long long
using T = pair<int, int>;
//set<int>S;
//unordered_map<int, int>mp;
const int N = 1e5 + 10;
int a[N];
int b[N];
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int t; cin >> t;
while (t--) {
int n; cin >> n;
int i;
for (i = 1; i <= n; ++i) {
cin >> a[i];
b[i]=a[i];
}
int cnt{};
int maxNum{ 0 };
if (n & 1) {
for (i = n - 1; i >= 2; i -= 2) {
cnt += max(0ll, (b[i+1] - (b[i]+i*cnt))/i);
b[i] += cnt * i;
b[i - 1] += cnt * (i - 1);
}
for (i = 2; i <= n; ++i) {
if (b[i] < b[i - 1]) {
cout << -1 << endl;
break;
}
}
if(i<=n)continue;
for (i = 2; i <= n - 1; ++i) {
if (a[i - 1] - a[i] > maxNum) {
maxNum = a[i - 1] - a[i];
}
}
cout << maxNum << endl;
}
else {
for (i = 2; i <= n; ++i) {
if (a[i - 1] - a[i] > maxNum) {
maxNum = a[i - 1] - a[i];
}
}
cout << maxNum << endl;
}
}
return 0;
}