代码如下,在jls代码偷学的,欢迎大家补充~
for (int i = 1; i <= n; i ++) {
int mx = min((long long)w[i], a - (n - 1));
int mn = max((long long)1, a - (sum - w[i]));
int res = w[i] - (mx - mn + 1);
cout << res << ' '<<" \n"[i == n];
}
代码如下,在jls代码偷学的,欢迎大家补充~
for (int i = 1; i <= n; i ++) {
int mx = min((long long)w[i], a - (n - 1));
int mn = max((long long)1, a - (sum - w[i]));
int res = w[i] - (mx - mn + 1);
cout << res << ' '<<" \n"[i == n];
}