洛谷P2678

P2678 [NOIP 2015 提高组] 跳石头

调半天ans更新位置错了。

点击查看代码

#include<bits/stdc++.h>
using namespace std;
const int N = 50010;
int l, n, m;
vector<int>s(N);

bool check(int x) {
    int nows = 0;
    int cnt = 0;
    for(int i = 0; i <= n; i++) {
        if(s[i] - nows >= x) {nows = s[i];}
        else {cnt++;}
    }
    //if(l - now < x) cnt++;
    return cnt <= m;
}

int main() {
    cin >> l >> n >> m;
    s.resize(n + 1);
    for(int i = 0; i < n; i++) cin >> s[i];
    
    s[n] = l;
    int left = 1, right = l, ans = l;
    while(left <= right) {
        int mid = (left + right) / 2;
        if(check(mid)) {
            left = mid + 1;
            ans = mid;
        } else {
            right = mid - 1;
			//ans我原本在这里更新
        }
    }
    cout << ans << '\n';
    return 0;
}