LOJ P10011 愤怒的牛 题解

每日一题 day36 打卡

Analysis

非常水的二分模板，就直接二分答案，用贪心策略check就好了

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #define int long long
 #define maxn 100000+10
 #define rep(i,s,e) for(register int i=s;i<=e;++i)
 using namespace std;
 inline int read()
 {
     int x=;
     bool f=;
     char c=getchar();
     for(; !isdigit(c); c=getchar()) if(c=='-') f=;
     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';
     if(f) return x;
     return -x;
 }
 inline void write(int x)
 {
     if(x<){putchar('-');x=-x;}
     if(x>)write(x/);
     putchar(x%+'');
 }
 int n,m;
 int x[maxn];
 bool check(int dis)
 {
     int before=x[],num=;
     for(int i=;i<=n;i++)
     {
         if(x[i]-before<dis) continue;
         ++num;
         before=x[i];
     }
     if(num>=m) return true;
     return false;
 }
 signed main()
 {
     n=read();m=read();
     rep(i,,n)
     {
         x[i]=read();
     }
     sort(x+,x+n+);
     int l=,r=x[n],ans=;
     while(l<=r)
     {
         int mid=(l+r)>>;
         if(check(mid)==true)
             ans=mid,l=mid+;
         else if(check(mid)==false)
             r=mid-;
     }
     write(ans);
     return ;
 }

请各位大佬斧正（反正我不认识斧正是什么意思）