ZZU_LGY

题目链接 #include <iostream> #include <cstring> #include <algorithm> #include <cmath> using namespace std; const double PI = 3.141592653589; double dis(double x1,double y1,double x2,double y2) { return sqrt((x2-x1)*(x2-x1)+(y2-y1

check()结果方程，先增后减，凸函数 #include <iostream> #include <cstring> #include <algorithm> using namespace std; const int N = 200010; //#define int long long int T,x,y; int check(int mid) { return mid+min((x-2*mid)/4,y-3*mid); } signed main() {