CF 1623 C. Balanced Stone Heaps 二分
思路:二分检验答案#include <bits/stdc++.h>using namespace std;typedef long long ll;int a[200005],b[200005];int add[200005];int n;bool check(int t){ fill(add, add + 1 + n, 0); for (int i = 1;i <= n;i++)b[i] = a[i]; for (int i = n;i >=
原创
2022-01-07 21:00:56 ·
318 阅读 ·
0 评论