Codeforces Round #393 (Div. 2) Frodo and pillows

题意：

孩子分枕头。相邻的不差1.

思路：

二分

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <queue>
#include <stack>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <stack>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f

ll n,m,k;
int solve(ll x)
{
    ll left,right ;
    ll res=0;
    if(x>=k)
    {
        left=x-k+1;
        res+=(left+x)*(k)/2;
    }
    else
    {
        res+=(1+x)*x/2;
        res+=k-x;
    }
    if(x>=n-k+1)
    {
        right=x-(n-k);
        res+=(x+right)*(n-k+1)/2;
    }
    else
    {
        res+=(1+x)*( x)/2;
        res+=n-k+1-x;
    }
    res-=x;
    if(res<=m)
        return 1;
    else
        return 0;
}
int main()
{
    cin>>n>>m>>k;
    ll l=1,r=m;
    ll mid=(l+r)/2;
    ll ans=0;
    while(l<=r)
    {
        mid=(l+r)/2;
        if(solve(mid))
        {
            ans=mid;
            l=mid+1;
        }
        else
        {
            r=mid-1;
        }
    }
    cout<<ans<<endl;

    return 0;
}