极其离谱
查看原帖
极其离谱
679540
Forever_OIer楼主2023/6/29 11:00
//#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ps ' '
#define debug(x) cerr<<#x<<':'<<x<<'\n';
#define edl '\n'
#define cehh cerr<<'\n';
typedef long long ll;
using namespace std;
inline ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();return x*f;}
void wrint(ll x,short e){if(x<0){putchar('-');x=-x;}if(x>9){wrint(x/10,0);}putchar(x%10+'0');if(e==1){putchar('\n');}if(e==2){putchar(' ');}}//0:啥也不加  1:换行  2:空格
const ll N=1e5 +10,INF=0x7f7f7f7f7f7f7f7f;

ll n,m,k,l,r,ans,len,pos[N];
inline bool check(int x){
	int sum;
	for(int i=2;i<=n;i++){
		sum+=(pos[i]-pos[i-1])/x;
	}
	return sum<=k;
}
int main(){
//	freopen("123.in","r",stdin);
//	freopen("123.out","w,",stdout);
	len=read(),n=read(),k=read();
	for(int i=1;i<=n;i++){
		pos[i]=read();
		r=max(r,pos[i]-pos[i-1]);
	}
	l=len/(n+k-1);
	while(l<=r){
		int mid=l+r>>1;
		if(check(mid)){
			ans=mid;
			r=mid-1;
			debug(2)
		}else{
			l=mid+1;
			debug(1)
		}
	}
	wrint(ans,0);
//	fclose(stdin);
//	fclose(stdout);

	return 0;
}

就上面这个代码,我现在运行样例输出51,但是把36、39行那两个debug删掉之后运行样例就变成75了为什么啊

2023/6/29 11:00
加载中...