数据都对了还是过不了,DBUG的能力到底要何时才能提升啊
#include "iostream"
int N,K;
int a[100000];
int max;
bool OK(int t)
{
    int sum=0;
    for(int i=0;i<N;i++)
    {
        int X1=a[i]-t;
        int X2=K-1;
        int d=X1/X2;
        if(X1%X2!=0)d++;
        sum=sum+d;        
        if(sum>t)return false;
    }     
    return true;
}
int Bserch()
{
    int low=0,high=max;
    int mid;
    while(1)
    {
       mid=(low+high)/2;
       if(mid==low)return high;        
       if(OK(mid))
       {
           high=mid;           
       }
       else
       {
           low=mid;
       }
    }   
}
main()
{
    while(scanf("%d",&N)!=EOF)
    {
    max=0;
    for(int i=0;i<N;i++)
    {
      scanf("%d",&a[i]);
      max>?=a[i];
    }
    scanf("%d",&K);
    printf("%d\n",Bserch());  
    }
}