![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二分
yxr0105
这个作者很懒,什么都没留下…
展开
-
5.16pkusc模拟赛1
A.切绳子,不可多条连接,求n条绳子切成k段的最大长度。 卡精度?转成cm二分。n<=10000(5.16)#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>#define N 10005using namespace std;int n,k;double a[N]原创 2016-05-18 09:34:39 · 466 阅读 · 0 评论 -
poj2507 Crossed ladders
题意: 已知x,y,c,求d 题解:答案满足单调性,即x,y恒定时,d越大,c越小。因此可以二分答案。#include<cstdio>#include<cmath>#include<algorithm>using namespace std;#define eps 1e-5double l,r,mid,a,b,c,x,y,now;bool judge(double k){ x原创 2017-11-09 19:05:16 · 303 阅读 · 0 评论