xutian_curry的博客

#include <iostream>#include <memory.h>#include <math.h>#include <stdio.h>using namespace std;double fun(double x){ return pow( x, 3.0 ) - 5 * pow( x, 2.0 ) + 10.0*x -...

这是一个最小值最大化问题，可以将其转化为二分查找和判定性问题同样地，最大值最小化问题，也可以将其转化为二分查找和判定性问题#include <iostream>#include <memory.h>#include <math.h>#include <stdio.h>#include <unordered_map>#includ...

二分法解超越方程#include <iostream>#include <memory.h>#include <math.h>#include <stdio.h>#include <unordered_map>#include <string>#include <map>#include &l

将0/1分数规划问题转化为二分查找问题#include <iostream>#include <memory.h>#include <math.h>#include <stdio.h>#include <unordered_map>#include <string>#include <map>#inc

最大值最小化：二分查找答案注意一下初始化的细节#include <iostream>#include <string>#include <memory.h>#include <stdio.h>using namespace std;int N,M,cost[100005];bool check( int k ){ int num...