p1m2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 757 Accepted Submission(s): 282 Problem Description 度度熊很喜欢数组!!
Input 输入的第一行有一个正整数 T,代表接下来有几组测试数据。
Output 对于每一组测试数据,请依序各自在一行内输出一个整数,代表可能到达的平衡状态中最大的『数组中的最小值』,如果无法达成平衡状态,则输出 −1。
Sample Input 2 3 1 2 4 2 0 100000000
Sample Output 2 33333333
Source
小结:想不到二分所以不会,想到了二分分分钟秒了,还是太菜,至于为什么想不到二分,我觉得主要原因就是我没有多写几个特例看出对于任何一个序列一定能达到稳定的,想不到-1的情况,题解给的证明似是而非。
原题题解
二分一下可能达到的值,然后判断是否加法的次数小于或者等于减法的次数就好了,加法的次数是每个比mid的值所贡献的mid-a[i]的和,减法的和是每个比mid大的数,
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define IO ios::sync_with_stdio(false),cin.tie(0)
#define FIN freopen("D://code//in.txt", "r", stdin)
#define ppr(i,x,n) for(int i = x;i <= n;i++)
#define rpp(i,n,x) for(int i = n;i >= x;i--)
const double eps = 1e-8;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 7;
const double pi = acos(-1);
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
inline ll qow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline int read() {//读入挂
int ret = 0, c, f = 1;
for(c = getchar(); !(isdigit(c) || c == '-'); c = getchar());
if(c == '-') f = -1, c = getchar();
for(; isdigit(c); c = getchar()) ret = ret * 10 + c - '0';
if(f < 0) ret = -ret;
return ret;
}
int a[maxn];
int n;
ll ans;
bool judge(ll mid)
{
ll sumx = 0,sumy = 0;
ppr(i,1,n)
{
if(a[i] < mid)
{
sumx += (mid-a[i]);
}
else if(a[i] > mid)
{
sumy += (a[i]-mid)/2;
}
}
return sumx <= sumy;
}
int main()
{
int t;scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
ppr(i,1,n){scanf("%d",a+i);}
int Max = a[1],Min = a[1];
ppr(i,1,n){if(Max < a[i])Max = a[i];if(Min > a[i])Min = a[i];}
ll l = Min,r = Max;
while(l <= r)
{
ll mid = (l+r)>>1;
if(judge(mid))
{
l = mid+1;
ans = mid;
}
else
{
r = mid-1;
}
}
printf("%lld\n",ans);
}
return 0;
}