题目链接:http://poj.org/problem?id=2456题目大意:有n个牛栏，m头牛，将牛放入栏中，要使它们的最小距离尽可能大，输出这个最小距离。二分搜索。#include#include#include#include#include#include#include#include#include#include#include#include#

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4004#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2199二分最简单的应用#include#includedouble cal(double x){ return 8*x*x*x*x+7*x*x*x+2*x*x+3*x+6;}int main(){ int t; scanf("%d",&t); whi

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2899#include#includedouble F(double x,double y){ return 6*x*x*x*x*x*x*x+8*x*x*x*x*x*x+7*x*x*x+5*x*x-y*x;}double f(double x,double y){ ret

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2578#include#include#define INF 0x3f3f3f3fusing namespace std;int a[100005],n,k;int judge(int l,int r,int x){ while(l<=r) { int m

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2141这个题思路和HDU的2578差不多，只是多了一个数组，将其中的两个数组合并为一个数组再与第三个数组按照与HDU2578类似的二分方法做即可。做此题可以参照HDU2578:http://blog.csdn.net/qq_30076791/article/details/50444976#

题目链接:http://poj.org/problem?id=1064#include#include#includeusing namespace std;int n,k;double a[10005];double carry(double x){ int sum=0; for(int i=0; i<n; i++) sum+=(int)(a[i

题目链接:http://poj.org/problem?id=3104#include#include#include#define INF 0x3f3f3f3fusing namespace std;int n;long long a[100005],k,l,r,sum,mid;int main(){ while(~scanf("%d",&n)) {

#include#include#includeusing namespace std;int t,n;long long k,a[100000];bool judge(int l,int r,int m){ int mid; while(l<=r) { mid=(l+r)/2; if(a[mid]+m==k)