题目链接:http://poj.org/problem?id=1064
题目大意:给你n段绳子和它们各自的长度,问能从中间找到最长的公共长度是多少?
套用二分搜索的模板,我们设最长的长度为x。在区间初始化时r = INF,l = 0。即可。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define lson l m rt << 1
#define rson m+1 r rt << 1|1
using namespace std;
typedef long long ll;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int INF = 0x3f3f3f3f;
const int maxn = 1e6+10;
const int mod = 1000;
double a[maxn];
ll T,n,k;
inline void fast()
{
ios_base::sync_with_stdi