M 有效算法

M 有效算法

本题考验二分知识，思路是二分k的取值，就按第一组样例来说当我们k取值为1的时候我们遍历数组想让|8-x| long long ml = a[1] - 1ll * b[1] * k; long long mr = a[1] + 1ll * b[1] * k; findex.php/tags-1038.html" >or (int i = 2; i long long ll = a[i] - 1ll * b[i] * k; long long rr = a[i] + 1ll * b[i] * k; if (ll ml)ml = ll; if (rr > n; for(int i = 1; i > a[i]; for(int i = 1; i > b[i]; int l = 0, r = 1e9; while (l int mid = (l + r) > 1; if (cheak(mid))r = mid-1; else l = mid+1; } cout