B. Game of Ball Passing

// Problem: B. Game of Ball Passing
// Contest: Codeforces - Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)
// URL: https://codeforces.com/contest/1649/problem/B
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-06 18:43:00
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;
//const ll mod = 998244353;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	int n;
	cin >> n;
	vector<int> a(n + 1);
	ll sum = 0, maxv = 0;
	for (int i = 1; i <= n ;i ++) {
		cin >> a[i];
		sum += a[i];
		maxv = max (maxv, a[i]);
	}
	if (maxv == 0) puts("0");
	else if (sum - maxv < maxv) {
		cout << maxv ((ll)1, maxv * 2 - sum) << endl;
	}
	else puts("1");
	
} 
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    cin >> t;
    while (t --) solve();
    return 0;
}

对于sum - maxv >= maxv。我们通过研究子问题，比较容易解决的问题获得答案 当sum - maxv >= maxv的时候 例如4 6 8 我们有一种做法，1->2->3->2->1这样1和2以1的代价换的3的2的代价。最终可以发现临界条件，4,6,10都可以用这样的方法变成相邻的数字，已知相邻的数字容易用一个球解决