Halfway Gym - 101652Q （二分）

题目链接

#include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
#define int long long int
typedef pair<int, int> PII;
const int inf = 0x3f3f3f3f;
const int N = 1e4 + 7;

signed main() {
    int n;
    cin >> n;
    int sum = n * (n - 1) / 2;  //Cn2  前n项和Sn=n*a1+n*(n-1)*d/2  a1=n-1,d=1
    int M = (sum + 1) / 2;
    int l = 1, r = n;
    while (l <= r) {
        int mid = l + r >> 1;
        int k = mid * (n - 1) - (mid - 1) * mid / 2;//等比数列求前mid项的和
        if (M > k - (n - mid) && M <= k) {
            cout << mid << endl;
            return 0;
        }
        if (k > M)
            r = mid - 1;
        else
            l = mid + 1;
    }
    return 0;
}