题目链接:http://codeforces.com/problemset/problem/760/B
题目大意:有n个人,共m个东西,每个人至少分得1个,相邻两人的物品个数之<=1,问第k个人最多能分多少个。
分析:这道题嘛,求约束条件的最大值,我们可以想到二分,设第K个人分x个,那么与他距离为1的人分x-1个,距离为2的人分x-2个。注意10^9=1e9不是1e8,这样WA了几发!!
code:
#include<cstdio>
#define min(a,b) (a<b?a:b)
typedef long long LL;
const LL MAXN=1e9+5;
LL n,m,k;
bool condition(LL x){
LL a=min(x,k);//两个等差数列长度
LL b=min(x,n-k+1);
LL sum=a*(x+x-(a-1))/2+b*(x+x-(b-1))/2-x;
return sum<=m;
}
int main(void){
scanf("%I64d%I64d%I64d",&n,&m,&k);
m=m-n;//先每人分一个
LL lo=-1,hi=m+1;
while(hi-lo>1){
LL mid=(hi+lo)/2;
if(condition(mid))lo=mid;
else hi=mid;
}
printf("%I64d\n",lo+1);
}